About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces
From MaRDI portal
Publication:2403743
DOI10.1007/s10851-017-0711-yzbMath1372.68229OpenAlexW2591780267MaRDI QIDQ2403743
Publication date: 12 September 2017
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10851-017-0711-y
Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
A characterization of 2-threshold functions via pairs of prime segments, Efficiently testing digital convexity and recognizing digital convex polygons
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gift-wrapping based preimage computation algorithm
- Digital planarity -- a review
- A simple algorithm for digital line recognition in the general case
- Some theoretical challenges in digital geometry: a perspective
- Minimum polygonal separation
- On the complexity of polyhedral separability
- On integer points in polyhedra
- On integer points in polyhedra: A lower bound
- Finding minimal convex nested polygons
- An elementary algorithm for digital arc segmentation
- On the maximal width of empty lattice simplices
- Digital circles, spheres and hyperspheres: from morphological models to analytical characterizations and topological properties
- An elementary digital plane recognition algorithm
- Projecting Lattice Polytopes Without Interior Lattice Points
- Introduction to Digital Level Layers
- Recognition of Digital Hyperplanes and Level Layers with Forbidden Points
- Integer Programming with a Fixed Number of Variables
- Implicit Digital Surfaces in Arbitrary Dimensions
- Discrete Representation of Straight Lines
- Computing the Continuous Discretely
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- A linear incremental algorithm for naive and standard digital lines and planes recognition
- Object discretizations in higher dimensions
- Digital Straightness
- Algorithms for polytope covering and approximation
- Arithmetic Discrete Hyperspheres and Separatingness
- Recognition of Digital Polyhedra with a Fixed Number of Faces
- On the min DSS problem of closed discrete curves
