Computational geometry: an introduction
Computational geometry: an introduction
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Rectangular partition is polynomial in two dimensions but NP-complete in three
Information Processing Letters
Discrete analytical hyperplanes
Graphical Models and Image Processing
Erased arrangements of lines and convex decompositions of polyhedra
Computational Geometry: Theory and Applications
Thin discrete triangular meshes
Theoretical Computer Science
Object discretizations in higher dimensions
Pattern Recognition Letters
Computer
The Power of Non-Rectilinear Holes
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Polyhedra generation from lattice points
DCGA '96 Proceedings of the 6th International Workshop on Discrete Geometry for Computer Imagery
Digital Geometry: Geometric Methods for Digital Picture Analysis
Digital Geometry: Geometric Methods for Digital Picture Analysis
Curves, hypersurfaces, and good pairs of adjacency relations
IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
Maximal digital straight segments and convergence of discrete geometric estimators
SCIA'05 Proceedings of the 14th Scandinavian conference on Image Analysis
On the polyhedral complexity of the integer points in a hyperball
Theoretical Computer Science
Some theoretical challenges in digital geometry: A perspective
Discrete Applied Mathematics
| Hi-index | 0.00 |
In recent years the problem of obtaining a reversible discrete surface polyhedrization (DSP) is attracting an increasing interest within the discrete geometry community. In this paper we propose the first algorithm for obtaining a reversible polyhedrization with a guaranteed performance, i.e., together with a bound on the ratio of the number of facets of the obtained polyhedron and one with a minimal number of facets. The algorithm applies to the case of a convex DSP when a discrete surface M is determined by a convex body in ℝ3. The performance estimation is based on a new lower bound (in terms of the diameter of M) on the number of 2-facets of an optimal polyhedrization. That bound easily extends to an arbitrary dimension n. We also discuss on approaches for solving the general 3D DSP.