An optimal algorithm for intersecting three-dimensional convex polyhedra
SIAM Journal on Computing
Geometric interpretation of Euclid's algorithm and recognition of segments
Theoretical Computer Science
Discrete Combinatorial Surfaces
Graphical Models and Image Processing
Combinatorics of patterns of a bidimensional Sturmian sequence.
Theoretical Computer Science
An arithmetic and combinatorial approach to three-dimensional discrete lines
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
| Hi-index | 0.00 |
This paper extends, in a multi-dimensional framework, pattern recognition technics for generation or recognition of digital lines. More precisely, we show how the connection between chain codes of digital lines and continued fractions can be generalized by a connection between tilings and multi-dimensional continued fractions. This leads to a new approach for generating and recognizing digital hyperplanes.