It is proved that a triangulation of a polyhedron can always be transformed into any other triangulation of the polyhedron using only elementary moves. One consequence is that an ...
: This note proposes a simple rule to determine a unique triangulation among all Delaunay triangulations of a planar point set, based on two preferred directions. We show that the ...
In this paper, we study the convergent property of a well known discretized scheme of Gaussian curvature, derived from Gauss-Bonnet theorem, over triangulated surface. Suppose the...
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtr...
Let S be a set of points in the plane in general position. A triangulation of S will be called even if all the points of S have an even degree. We show how to construct a triangul...
Abstract. We show that there is a matching between the edges of any two triangulations of a planar point set such that an edge of one triangulation is matched either to the identic...
Oswin Aichholzer, Franz Aurenhammer, Michael Tasch...
Given a triangulation in the plane or a tetrahedralization in 3-space, we investigate the efficiency of locating a point by walking in the structure with different
Consider a polyhedron that is triangulated into tetrahedra in two different ways. This paper presents an algorithm, and hints for implementation, for finding the volumes of the i...
A triangulation of a point set Pn is a partitioning of the convex hull Conv(Pn) into a set of triangles with disjoint interiors such that the vertices of these triangles are in Pn...