Computing a subgraph of the minimum weight triangulation

DOI10.1016/0925-7721(94)90014-0zbMath0807.68100OpenAlexW1988781483MaRDI QIDQ1327172

J. Mark Keil

Publication date: 1 March 1995

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(94)90014-0

zbMATH Keywords

minimum weight triangulationEuclidean graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (22)

Beta-skeletons have unbounded dilation ⋮ New results on MWT subgraphs ⋮ Triangulations without minimum-weight drawing ⋮ A fast heuristic for approximating the minimum weight triangulation ⋮ Drawing outerplanar minimum weight triangulations ⋮ The strength of weak proximity ⋮ DIAMONDS ARE NOT A MINIMUM WEIGHT TRIANGULATION'S BEST FRIEND ⋮ Unnamed Item ⋮ A new asymmetric inclusion region for minimum weight triangulation ⋮ Constrained independence system and triangulations of planar point sets ⋮ A better subgraph of the minimum weight triangulation ⋮ Steiner reducing sets of minimum weight triangulations: Structure and topology ⋮ On exclusion regions for optimal triangulations ⋮ A lower bound for \(\beta\)-skeleton belonging to minimum weight triangulations ⋮ A new subgraph of minimum weight triangulations ⋮ The minimum weight triangulation problem with few inner points ⋮ A study of the LMT-skeleton ⋮ On \(\beta\)-skeleton as a subgraph of the minimum weight triangulation ⋮ The drawability problem for minimum weight triangulations ⋮ Triangulations intersect nicely ⋮ LMT-skeleton heuristics for several new classes of optimal triangulations ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on Delaunay and optimal triangulations
• The \(\gamma\)-neighborhood graph
• Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation
• A heuristic triangulation algorithm
• A New Heuristic for Minimum Weight Triangulation
• Minimal Triangulations of Polygonal Domains

This page was built for publication: Computing a subgraph of the minimum weight triangulation