Abstract.
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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received August 16, 1999, and in revised form February 29, 2000. Online publication May 19, 2000.
Rights and permissions
About this article
Cite this article
Below, A., Brehm, U., De Loera, J. et al. Minimal Simplicial Dissections and Triangulations of Convex 3-Polytopes . Discrete Comput Geom 24, 35–48 (2000). https://doi.org/10.1007/s004540010058
Issue Date:
DOI: https://doi.org/10.1007/s004540010058