133 search results - page 1 / 27 » Approximating the Minimum Weight Triangulation |
SODA
1992
ACM
13 years 5 months ago
1992
ACM
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...
CCCG
2007
13 years 6 months ago
2007
We introduce bundle-free triangulations, that are free of large collection of triangles overlapping a circle empty of vertices. We prove that bundle-free Steiner triangulations ca...
COMGEO
2002
ACM
13 years 4 months ago
2002
ACM
We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner ...
STOC
2006
ACM
13 years 10 months ago
2006
ACM
JCO
2010
13 years 3 months ago
2010
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...