Sciweavers

DCG
2000
94views more  DCG 2000»
13 years 11 months ago
Finding Small Triangulations of Polytope Boundaries Is Hard
We prove that it is NP-hard to decide whether a polyhedral 3-ball can be triangulated with k simplices. The construction also implies that it is difficult to find the minimal trian...
Jürgen Richter-Gebert