Computational geometry: an introduction
Computational geometry: an introduction
Shortest paths in the plane with convex polygonal obstacles
Information Processing Letters
A robust filtering algorithm for subpixel reconstruction of chain coded line drawings
IEEE Transactions on Pattern Analysis and Machine Intelligence
A geometric approach to subpixel registration accuracy
Computer Vision, Graphics, and Image Processing
Compression of Chain codes using digital straight line sequences
Pattern Recognition Letters
On the Number of Digital Straight Line Segments
IEEE Transactions on Pattern Analysis and Machine Intelligence
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Algorithms for Graphics and Imag
Algorithms for Graphics and Imag
Efficiency of Characterizing Ellipses and Ellipsoids by Discrete Moments
IEEE Transactions on Pattern Analysis and Machine Intelligence
On Recursive, O(N) Partitioning of a Digitized Curve into Digital Straight Segments
IEEE Transactions on Pattern Analysis and Machine Intelligence
The Reconstruction of the Digital Hyperbola Segment from Its Code
DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
On Characterization of Discrete Triangles by Discrete Moments
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
On discrete triangles characterization
Computer Vision and Image Understanding
Digital straightness: a review
Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
On the Number of Digital Discs
Journal of Mathematical Imaging and Vision
Factors of characteristic words of irrational numbers
Theoretical Computer Science
Some characterizations of finite Sturmian words
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
On the number of digitizations of a disc depending on its position
IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
| Hi-index | 0.15 |
A 1:1 correspondence is established between digital straight lines which start at a fixed point and a simple set of quadruples of integer parameters. Such a representation by parameters is useful for enumeration, First, the authors show a 1:1 correspondence between point pairs in a planar set of points and the linear dichotomies of this set. Then, from the equivalence between digital lines and linear dichotomies of points on the digitization grid, they prove a 1:1 and 'onto' correspondence between digital straight lines starting at a fixed point and a well-defined set of pairs of grid points. It follows that four parameters uniquely represent any given digital line with a fixed starting point. An O(N) algorithm is given for determining the parameters from the digital line, as well as O(log N) algorithms for transforming between these parameters and the parameters suggested by L. Dorst and A.W.M. Smeulders (1984).