On the Minimum Weight Steiner Triangular Tiling problem
Conference
·
OSTI ID:62614
In this paper, we introduce the Minimum Weight Steiner Triangular Tiling problem, which is a generalization of the Minimum Weight Steiner Triangulation. Contrary to the conjecture of Eppstein that the Minimum Weight Steiner Triangulation of a convex polygon has the property that the Steiner points all lie on the boundary of the polygon [Epp94], we show that the Steiner points of a Minimum Weight Steiner Triangular Tiling could lie in the interior of a convex polygon.
- Research Organization:
- Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- W-7405-ENG-36
- OSTI ID:
- 62614
- Report Number(s):
- LA-UR-95-1155; CONF-950891-1; ON: DE95009482
- Resource Relation:
- Conference: 7. Canadian conference on computation geometry, Quebec City (Canada), 10-14 Aug 1995; Other Information: PBD: [1995]
- Country of Publication:
- United States
- Language:
- English
Similar Records
Refining a triangulation of a planar straight-line graph to eliminate large angles
A near-optimal heuristic for minimum weight triangulation of convex polygons
Triangulations (tilings) and certain block triangular matrices
Conference
·
Thu May 13 00:00:00 EDT 1993
·
OSTI ID:62614
A near-optimal heuristic for minimum weight triangulation of convex polygons
Conference
·
Sun Jun 01 00:00:00 EDT 1997
·
OSTI ID:62614
Triangulations (tilings) and certain block triangular matrices
Technical Report
·
Thu Sep 01 00:00:00 EDT 1983
·
OSTI ID:62614