A linear incremental algorithm for naive and standard digital lines and planes recognition
From MaRDI portal
Publication:4421334
DOI10.1016/S1524-0703(03)00008-0zbMath1039.68141OpenAlexW1967192766MaRDI QIDQ4421334
Publication date: 20 August 2003
Published in: Graphical Models (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s1524-0703(03)00008-0
Related Items
About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces ⋮ A simple algorithm for digital line recognition in the general case ⋮ An optimized framework for plane-probing algorithms ⋮ A generalized preimage for the digital analytical hyperplane recognition ⋮ An alternative definition for digital convexity ⋮ On Three Constrained Versions of the Digital Circular Arc Recognition Problem ⋮ Digital Plane Recognition with Fewer Probes
