Some theoretical challenges in digital geometry: a perspective
From MaRDI portal
Publication:967394
DOI10.1016/j.dam.2009.04.022zbMath1186.68487OpenAlexW1975578308MaRDI QIDQ967394
Tetsuo Asano, Valentin E. Brimkov, Reneta P. Barneva
Publication date: 28 April 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.04.022
parallel algorithmVoronoi diagramcomputational geometrycomplexity theorydigital geometrycombinatorial image analysisin-place algorithmzone diagrampolyhedral reconstruction
Related Items
About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces ⋮ Mollified Zone Diagrams and Their Computation ⋮ Accelerating a continuous-time analog SAT solver using GPUs ⋮ Efficiently testing digital convexity and recognizing digital convex polygons ⋮ Digital Straightness, Circularity, and Their Applications to Image Analysis
Cites Work
- Integer points on curves and surfaces
- Digital planarity -- a review
- On the polyhedral complexity of the integer points in a hyperball
- Finding a minimum medial axis of a discrete shape is NP-hard
- Minimum decomposition of a digital surface into digital plane segments is NP-hard
- Digitization scheme that assures faithful reconstruction of plane figures
- The vertices of the knapsack polytope
- On integer points in polyhedra: A lower bound
- The convex hull of the integer points in a large ball
- Optimal parallel two dimensional text searching on a CREW PRAM
- A unified linear-time algorithm for computing distance maps
- Real data-integer solution problems within the Blum-Shub-Smale computational model
- On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology
- Digital straightness -- a review
- Decomposition of a three-dimensional discrete object surface into discrete plane pieces
- Zone Diagrams: Existence, Uniqueness, and Algorithmic Challenge
- Fast parallel and serial approximate string matching
- Optimization Schemes for the Reversible Discrete Volume Polyhedrization Using Marching Cubes Simplification
- On the Unlimited Number of Faces in Integer Hulls of Linear Programs with a Single Constraint
- The maximum numbers of faces of a convex polytope
- On the Topological Properties of Quantized Spaces, I. The Notion of Dimension
- The distance trisector curve
- On the min DSS problem of closed discrete curves
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
