Computational Geometry Column 40
Joseph O'Rourke
Abstract
It has recently been established by Below, De Loera, and Richter-Gebert that finding a minimum size (or even just a small) triangulation of a convex polyhedron is NP-complete. Their 3SAT-reduction proof is discussed.
Create a lesson
Related papers
A Bicriteria Approximation Scheme for the Minimum Well-Separated Pair Decomposition
Guilherme D. da Fonseca
Tiling 3D by Translates of a Single Polycube is Undecidable
Erik D. Demaine, Stefan Langerman
Deterministic Distance Selection in O(n4/3) Time
Haitao Wang
Simulated Annealing for Antenna Placements
Mikkel Abrahamsen, Jacobus Conradi, Asbjørn Lind
Exposition of an approximation algorithm for mixed volumes of a constant number of convex bodies
Hariharan Narayanan
Tight Bounds for Tusnády's Problem in the Plane
Zhewei Wei