Combinatorial generation of planar sets
From MaRDI portal
Publication:6078190
DOI10.1007/s10851-023-01152-zOpenAlexW4384408077MaRDI QIDQ6078190
Publication date: 24 October 2023
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10851-023-01152-z
continued fractionsEuclidean algorithmsubstitutionsdigital geometrydigital planeplane-probing algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A study of Jacobi-Perron boundary words for the generation of discrete planes
- Brun expansions of stepped surfaces
- Generation and recognition of digital planes using multi-dimensional continued fractions
- Digital planarity -- a review
- Geometric interpretation of the Euclidean algorithm and recognition of segments
- Digital straightness -- a review
- An optimized framework for plane-probing algorithms
- A \(d\)-dimensional extension of Christoffel words
- Two plane-probing algorithms for the computation of the normal vector to a digital plane
- Algebraic numbers, free group automorphisms and substitutions on the plane
- Facet Connectedness of Discrete Hyperplanes with Zero Intercept: The General Case
- Critical Connectedness of Thin Arithmetical Discrete Planes
- Facet Connectedness of Arithmetic Discrete Hyperplanes with Non-Zero Shift
- MULTIDIMENSIONAL STURMIAN SEQUENCES AND GENERALIZED SUBSTITUTIONS
- Generation of Digital Planes Using Generalized Continued-Fractions Algorithms
- Pisot substitutions and Rauzy fractals
- Approximation of digital surfaces by a hierarchical set of planar patches
This page was built for publication: Combinatorial generation of planar sets