92 search results - page 3 / 19 » The Number of Triangulations on Planar Point Sets |
CAGD
2008
13 years 6 months ago
2008
A simple proof is provided for the fact that the set of all possible triangulations of a planar point set in a polygonal domain is closed under the basic diagonal flip operation.
COMPGEOM
2006
ACM
14 years 7 days ago
2006
ACM
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
CCCG
2007
13 years 7 months ago
2007
We propose a method for computing acute (non-obtuse) triangulations. That is, for a given two dimensional domain (a set of points or a planar straight line graph), we compute a tr...
CCCG
2007
13 years 7 months ago
2007
We analyze the minimum and maximum number of empty pseudo-triangles defined by any planar point set. We consider the cases where the three convex vertices are fixed and where th...
CCCG
2003
13 years 7 months ago
2003
We introduce the concept of a constrained pointed pseudo-triangulation TG of a point set S with respect to a pointed planar straight line graph G = (S, E). For the case that G for...