Drawing outerplanar minimum weight triangulations

DOI10.1016/0020-0190(96)00012-9zbMath0875.68700OpenAlexW2036941007WikidataQ62042637 ScholiaQ62042637MaRDI QIDQ1351606

Giuseppe Liotta, William J. Lenhart

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00012-9

zbMATH Keywords

Computational geometryGraph drawingMinimum weight triangulations

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Triangulations without minimum-weight drawing, Minimum weight pseudo-triangulations, Unnamed Item, The drawability problem for minimum weight triangulations, Voronoi drawings of trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The greedy and Delaunay triangulations are not bad in the average case
• On approximation behavior of the greedy triangulation for convex polygons
• A note on Delaunay and optimal triangulations
• Computing the minimum weight triangulation of a set of linearly ordered points
• Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation
• Computing a subgraph of the minimum weight triangulation
• Algorithms for drawing graphs: An annotated bibliography
• New results for the minimum weight triangulation problem
• Triangulations intersect nicely
• A New Heuristic for Minimum Weight Triangulation
• Minimal Triangulations of Polygonal Domains