Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
Introduction to algorithms
On the recognition of digital planes in three-dimensional space
Pattern Recognition Letters
Discrete analytical hyperplanes
Graphical Models and Image Processing
Geometric Constructions in the Digital Plane
Journal of Mathematical Imaging and Vision
Concrete Mathematics: A Foundation for Computer Science
Concrete Mathematics: A Foundation for Computer Science
Computing the characteristics of a subsegment of a digital straight line in logarithmic time
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Duality and geometry straightness, characterization and envelope
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Walking in the farey fan to compute the characteristics of a discrete straight line subsegment
DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
Discrete Applied Mathematics
Hi-index | 0.00 |
Digital geometry is very different from Euclidean geometry in many ways and the intersection of two digital lines or planes is often used to illustrate those differences. Nevertheless, while digital lines and planes are widely studied in many areas, very few works deal with the intersection of such objects. In this paper, we investigate the geometrical and arithmetical properties of those objects. More precisely, we give some new results about the connectivity, periodicity, and minimal parameters of the intersection of two digital lines or planes.