volume 26, issue 4, P499-511 2001
DOI: 10.1007/s00454-001-0045-8
View full text
|
|
Share

Abstract: A minimum triangulation of a convex 3-polytope is a triangulation that contains the minimum number of tetrahedra over all its possible triangulations. Since finding minimum triangulations of convex 3-polytopes was recently shown to be NP-hard, it becomes significant to find algorithms that give good approximation. In this paper we give a new triangulation algorithm with an improved approximation ratio 2 − (1/ √ n), where n is the number of vertices of the polytope. We further show that this is the best possib…

Expand abstract

Search citation statements

Order By: Relevance

Paper Sections

0
0
0
0
0

Citation Types

0
16
0

Publication Types

Select...

Relationship

0
0

Authors

Journals