A near-optimal heuristic for minimum weight triangulation of convex polygons
Conference
·
OSTI ID:471709
- Lund Univ. (Sweden)
A linear-time heuristic for minimum weight triangulation of convex polygons is presented. This heuristic produces a triangulation of length within a factor 1 + {epsilon} from the optimum, where {epsilon} is an arbitrarily small positive constant. This is the first sub-cubic algorithm which guarantees such an approximation factor, and it has interesting applications.
- OSTI ID:
- 471709
- Report Number(s):
- CONF-970142--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Quasi-greedy triangulations approximating the minimum weight triangulation
On the Minimum Weight Steiner Triangular Tiling problem
Optimal placement of convex polygons to maximize point containment
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:416823
On the Minimum Weight Steiner Triangular Tiling problem
Conference
·
Fri Mar 31 23:00:00 EST 1995
·
OSTI ID:62614
Optimal placement of convex polygons to maximize point containment
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:416792