The complexity of finding small triangulations of convex 3-polytopes
From MaRDI portal
Publication:4820878
DOI10.1016/S0196-6774(03)00092-0zbMath1067.68077arXivmath/0012177MaRDI QIDQ4820878
No author found.
Publication date: 1 October 2004
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0012177
68Q25: Analysis of algorithms and problem complexity
52B55: Computational aspects related to convexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Minimizing visible edges in polyhedra, Conservative interpolation between volume meshes by local Galerkin projection, Three ways to cover a graph, Exact asymptotics of the uniform error of interpolation by multilinear splines