Recognition of Digital Hyperplanes and Level Layers with Forbidden Points
From MaRDI portal
Publication:3003530
DOI10.1007/978-3-642-21073-0_15zbMath1330.68312MaRDI QIDQ3003530
Publication date: 27 May 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21073-0_15
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Separability and Tight Enclosure of Point Sets, Fitting discrete polynomial curve and surface to noisy data, About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces
Cites Work
- Unnamed Item
- Unnamed Item
- Digital planarity -- a review
- 3D noisy discrete objects: Segmentation and application to smoothing
- An elementary algorithm for digital arc segmentation
- An elementary digital plane recognition algorithm
- Introduction to Digital Level Layers
- Linear Programming in Linear Time When the Dimension Is Fixed
- An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition