The minimum triangulation of a convex polyhe- dron is a triangulation that contains the minimum number of tetrahedra over all its possible trian- gulations.
In this paper we improve the approximation ratio of finding minimum triangulations for some special classes of 3-dimensional convex polyhedra. (1) For polyhedra ...
This paper gives a new triangulation algorithm with an im1 proved approximation ratio and shows that this is best possible for algorithms that only consider ...
In this paper we improve the approximation ratio of finding minimum triangulations for some special classes of 3-dimensional convex polytopes.
Abstract. Finding minimum triangulations of convex polyhedra is NP- hard. The best approximation algorithms only give a ratio 2 for this.
In this paper we improve the approximation ratio of finding minimum triangulations for some special classes of 3-dimensional convex polytopes. (1) For polytopes ...
In computational geometry and computer science, the minimum-weight triangulation problem is the problem of finding a triangulation of minimal total edge length.
Missing: polyhedra. | Show results with:polyhedra.
(1) The “coning” triangulation proposed in [13] provides an algorithm which is polyno- mial on the number of vertices and gives a 2-approximation of the minimal ...
Triangulation of 3D polygons is a well studied topic of research. Existing methods for finding triangulations that minimize given metrics (e.g., sum of triangle ...
In this paper we give a new triangulation algorithm with an improved approximation ratio 2 - Ω(1/\sqrt n ) , where n is the number of vertices of the polytope.