Quasi-greedy triangulations approximating the minimum weight triangulation
- Lund Univ. (Sweden)
This paper settles the following two open problems: (1) What is the worst-case approximation ratio between the greedy and the minimum weight triangulation? (2) Is there a polynomial time algorithm that always pro- duces a triangulation whose length is within a constant factor from the minimum? The answer to the first question is that the known {Omega}({radical}n) lower bound is tight. The second question is answered in the affirmative by using a slight modification of an O(n log n) algorithm for the greedy triangulation. We also derive some other interesting results. For example, we show that a constant-factor approximation of the minimum weight convex partition can be obtained within the same time bounds.
- OSTI ID:
- 416823
- Report Number(s):
- CONF-960121--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Limit theorems for minimum-weight triangulations, other euclidean functionals, and probabilistic recurrence relations
On the Minimum Weight Steiner Triangular Tiling problem