Minimal Simplicial Dissections and Triangulations of Convex 3-Polytopes
- Cite this article as:
- Below, A., Brehm, U., De Loera, J. et al. Discrete Comput Geom (2000) 24: 35. doi:10.1007/s004540010058
- 59 Downloads
This paper addresses three questions related to minimal triangulations of a three-dimensional convex polytope P .
• Can the minimal number of tetrahedra in a triangulation be decreased if one allows the use of interior points of P as vertices?
• Can a dissection of P use fewer tetrahedra than a triangulation?
• Does the size of a minimal triangulation depend on the geometric realization of P ?
The main result of this paper is that all these questions have an affirmative answer. Even stronger, the gaps of size produced by allowing interior vertices or by using dissections may be linear in the number of points.