Some theoretical challenges in digital geometry: a perspective
From MaRDI portal
Recommendations
- Combinatorial and discrete geometric problems in image analysis
- scientific article; zbMATH DE number 513213
- Editorial: Discrete geometry for computer imagery
- Digital geometry, mathematical morphology, and discrete optimization: a survey
- Discrete geometry and topology and their applications to imaging sciences
Cites work
- A unified linear-time algorithm for computing distance maps
- Decomposition of a three-dimensional discrete object surface into discrete plane pieces
- Digital planarity -- a review
- Digital straightness -- a review
- Digitization scheme that assures faithful reconstruction of plane figures
- Fast parallel and serial approximate string matching
- Finding a minimum medial axis of a discrete shape is NP-hard
- scientific article; zbMATH DE number 2129318 (Why is no real title available?)
- scientific article; zbMATH DE number 3735554 (Why is no real title available?)
- scientific article; zbMATH DE number 3757746 (Why is no real title available?)
- scientific article; zbMATH DE number 3767037 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1250624 (Why is no real title available?)
- scientific article; zbMATH DE number 1044854 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 801745 (Why is no real title available?)
- Integer points on curves and surfaces
- Introduction to algorithms
- Minimum decomposition of a digital surface into digital plane segments is NP-hard
- On integer points in polyhedra: A lower bound
- On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology
- On the min DSS problem of closed discrete curves
- On the polyhedral complexity of the integer points in a hyperball
- On the Topological Properties of Quantized Spaces, I. The Notion of Dimension
- On the Unlimited Number of Faces in Integer Hulls of Linear Programs with a Single Constraint
- Optimal parallel two dimensional text searching on a CREW PRAM
- Optimization Schemes for the Reversible Discrete Volume Polyhedrization Using Marching Cubes Simplification
- Real data-integer solution problems within the Blum-Shub-Smale computational model
- The convex hull of the integer points in a large ball
- The distance trisector curve
- The maximum numbers of faces of a convex polytope
- The vertices of the knapsack polytope
- Zone Diagrams: Existence, Uniqueness, and Algorithmic Challenge
Cited in
(8)- Efficiently testing digital convexity and recognizing digital convex polygons
- 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
- scientific article; zbMATH DE number 1246221 (Why is no real title available?)
- Digital straightness, circularity, and their applications to image analysis
- Combinatorial and discrete geometric problems in image analysis
- Accelerating a continuous-time analog SAT solver using GPUs
- Digital geometry, mathematical morphology, and discrete optimization: a survey
This page was built for publication: Some theoretical challenges in digital geometry: a perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q967394)
