| ON THE ORDER PROPERTIES OF DIGITAL CURVES IN THE PAN-EUCLIDEAN GEOMETRY |
| |
| 引用本文： | GONGCHU HUANGQIDE DUJIANGCHUAN LIUHONGJIAN. ON THE ORDER PROPERTIES OF DIGITAL CURVES IN THE PAN-EUCLIDEAN GEOMETRY[J]. 高校应用数学学报(英文版), 1995, 10(1): 89-102. DOI: 10.1007/BF02663899 |
| |
| 作者姓名： | GONGCHU HUANGQIDE DUJIANGCHUAN LIUHONGJIAN |
| |
| 作者单位： | [1]DepartmentofSystemEngineeringandAppliedMathenmtics,ChongqingUniversity,Chongqing630044 [2]DepartmentofMathematics,ChongqingTeacher＇sCollege,Chongqing630030 [3]DepartmentofOptoelectronicInstruments,ChongqingUniversity,Chongqing630044 [4]DepartmentofOptoelectronicInstruments,ChongqingUniversity,Chongqing630044. |
| |
| 摘 要： | How to increase the speed in drawing and recognizing curves has always been a major concern. From the Breshenham Algorithm and DDA Algorithm in the sixties to the double-step and quadruple-step line generation iu the eighties, curves were all dragon point by point. The algorithm in this paper fully utilizes machine commands to accelerate the generation of lines and curves. We introduce and prove for the first time characterization theorems of the segment code order of digital lines and curyes. These theorems give new methods in the recognition and the measure of smoothness of lines and curves.
|
| 关 键 词： | 数字曲线 欧氏几何 Breshenham算法 DDA算法 光滑度 |
| 收稿时间： | 1992-07-16 |
On the order properties of digital curves in the pan-euclidean geometry |
| |
| Gong Chu,Huang Qide,Du Jiangchuan,Liu Hongjaan. On the order properties of digital curves in the pan-euclidean geometry[J]. Applied Mathematics A Journal of Chinese Universities, 1995, 10(1): 89-102. DOI: 10.1007/BF02663899 |
| |
| Authors: | Gong Chu Huang Qide Du Jiangchuan Liu Hongjaan |
| |
| Affiliation: | (1) Department of System Engineering and Applied Mathematics, Chongqing University, 630044 Chongquing;(2) Department of Mathematics, Chongqing Teacher’s College, 630030 Chongqing;(3) Department of Optoelectronic Instruments, Chongqing University, 630044 Chongqing;(4) Department of Optoelectronic Instruments, Chongqing University, 630044 Chongqing |
| |
| Abstract: | How to increase the speed in drawing and recognizing curves has always been a major concern. From the Breshenham Algorithm and DDA Algorithm in the sixties to the double-step and quadruple-step line generation in the eighties, curves were all drawn point by point. The algorithm in this paper fully utilizes machine commands to accelerate the generation of lines and curves. We introduce and prove for the first time characterization theorems of the segment code order of digital lines and curves. These theorems give new methods in the recognition and the measure of smoothness of lines and curves. Research supported by the National Natural Science Foundation of China. |
| |
| Keywords: | 68T |
| 本文献已被 CNKI 维普 SpringerLink 等数据库收录！ |
