Digital planarity -- a review

DOI10.1016/j.dam.2006.08.004zbMath1109.68122OpenAlexW2118341025WikidataQ60574804 ScholiaQ60574804MaRDI QIDQ869568

Reinhard Klette, David Coeurjolly, Valentin E. Brimkov

Publication date: 8 March 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.08.004

zbMATH Keywords

Sturmian wordsgeometric algorithmsdigital geometryarithmetic geometrydigital planes2D array periodicity

Mathematics Subject Classification ID

Image analysis in multivariate analysis (62H35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Discrete geometry (52C99)

Related Items

From prima quadraginta octant to lattice sphere through primitive integer operations ⋮ An output-sensitive algorithm to compute the normal vector of a digital plane ⋮ Generation and recognition of digital planes using multi-dimensional continued fractions ⋮ Gift-wrapping based preimage computation algorithm ⋮ Functional stepped surfaces, flips, and generalized substitutions ⋮ On the characterization of absentee-voxels in a spherical surface and volume of revolution in \({\mathbb Z}^3\) ⋮ Two plane-probing algorithms for the computation of the normal vector to a digital plane ⋮ About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces ⋮ On the functionality and usefulness of quadraginta octants of naive sphere ⋮ On different topological classes of spherical geodesic paths and circles in \(\mathbb{Z}^3\) ⋮ Determining digital circularity using integer intervals ⋮ Combinatorial generation of planar sets ⋮ Approximation of digital surfaces by a hierarchical set of planar patches ⋮ A combinatorial technique for generation of digital plane using GCD ⋮ About thin arithmetic discrete planes ⋮ On efficient computation of inter-simplex Chebyshev distance for voxelization of 2-manifold surface ⋮ Recognition of Digital Hyperplanes and Level Layers with Forbidden Points ⋮ Topological analysis of voxelized objects by discrete geodesic Reeb graph ⋮ Digital Straightness, Circularity, and Their Applications to Image Analysis ⋮ Fast circular arc segmentation based on approximate circularity and cuboid graph ⋮ On the polyhedra of graceful spheres and circular geodesics ⋮ Some theoretical challenges in digital geometry: a perspective ⋮ Formulas for the number of \((n-2)\)-gaps of binary objects in arbitrary dimension ⋮ A generalized preimage for the digital analytical hyperplane recognition ⋮ Minimal arithmetic thickness connecting discrete planes ⋮ Minimum decomposition of a digital surface into digital plane segments is NP-hard ⋮ About the Frequencies of Some Patterns in Digital Planes Application to Area Estimators ⋮ Gift-Wrapping Based Preimage Computation Algorithm ⋮ An alternative definition for digital convexity ⋮ DIG: Discrete Iso-contour Geodesics for Topological Analysis of Voxelized Objects ⋮ Arithmetic Discrete Planes Are Quasicrystals ⋮ A \(d\)-dimensional extension of Christoffel words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connectivity of discrete planes
• Periodicity and local complexity
• Combinatorics on patterns of a bidimensional Sturmian sequence
• On the flatness of digital hyperplanes
• Parallelogram tilings and Jacobi-Perron algorithm
• Thin discrete triangular meshes
• Tilings and rotations on the torus: A two-dimensional generalization of Sturmian sequences
• Graceful planes and lines.
• Balance properties of multi-dimensional words
• Plane digitization and related combinatorial problems
• On a conjecture on bidimensional words.
• Gradient elements of the knapsack polytope
• On digital plane preimage structure
• An elementary digital plane recognition algorithm
• Three-Dimensional Digital Planes
• Discrete Representation of Straight Lines
• Linear Programming in Linear Time When the Dimension Is Fixed
• Convex Digital Solids
• Discrete linear objects in dimension n: the standard model
• Object discretizations in higher dimensions
• Digital Straightness
• Combinatorial Image Analysis
• Double sequences of low complexity