Approximating the Minimum Weight Triangulation

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 quadtrees. In O(n log n) time we can compute a triangulation with O(n) new points, and no obtuse triangles, that approximates the MWST. We can also approximate the MWST with triangulations having no sharp angles. We generalize some of our results to higher dimensional triangulation problems. No previous polynomial time triangulation algorithm was known to approximate the MWST within a factor better than O(log n). 

• Type: Conference
• Year: 1992
• Where: SODA
• Authors: David Eppstein
• Keywords: Algorithms, SODA 1992, Triangulation, Triangulation Algorithm, Weight Steiner Triangulation