Computing the minimum weight triangulation of a set of linearly ordered points

DOI10.1016/0020-0190(92)90129-JzbMath0772.68106OpenAlexW2091743544MaRDI QIDQ1198019

David Rappaport, Henk G. Meijer

Publication date: 16 January 1993

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

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90129-j

zbMATH Keywords

triangulation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (4)

Drawing outerplanar minimum weight triangulations ⋮ Minimum convex partition of a constrained point set ⋮ A lower bound for \(\beta\)-skeleton belonging to minimum weight triangulations ⋮ The drawability problem for minimum weight triangulations

Cites Work

• Unnamed Item
• Unnamed Item
• The greedy and Delaunay triangulations are not bad in the average case
• A note on Delaunay and optimal triangulations
• Minimal Triangulations of Polygonal Domains

This page was built for publication: Computing the minimum weight triangulation of a set of linearly ordered points