Computing a subgraph of the minimum weight triangulation

DOI10.1016/0925-7721(94)90014-0MaRDI QIDQ1327172zbMATH OpenOpenAlexFDO

Authors 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

Euclidean graphsminimum weight triangulation

Mathematics Subject Classification ID

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

Recommendations

• On -skeleton as a subgraph of the minimum weight triangulation
• A large subgraph of the minimum weight triangulation
• A new subgraph of minimum weight triangulations
• A new subgraph of minimum weight triangulations
• A lower bound for -skeleton belonging to minimum weight triangulations

Cites work

• A heuristic triangulation algorithm
• A New Heuristic for Minimum Weight Triangulation
• A note on Delaunay and optimal triangulations
• scientific article; zbMATH DE number 432801 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 742947 (Why is no real title available?)
• Minimal Triangulations of Polygonal Domains
• Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation
• The \(\gamma\)-neighborhood graph

Cited in

(24)

• Drawing outerplanar minimum weight triangulations
• A new subgraph of minimum weight triangulations
• A large subgraph of the minimum weight triangulation
• Beta-skeletons have unbounded dilation
• Triangulations intersect nicely
• LMT-skeleton heuristics for several new classes of optimal triangulations
• The minimum weight triangulation problem with few inner points
• A new asymmetric inclusion region for minimum weight triangulation
• scientific article; zbMATH DE number 1629854 (Why is no real title available?)
• New results on MWT subgraphs
• Triangulations without minimum-weight drawing
• DIAMONDS ARE NOT A MINIMUM WEIGHT TRIANGULATION'S BEST FRIEND
• A fast heuristic for approximating the minimum weight triangulation
• On a linear program for minimum-weight triangulation
• On exclusion regions for optimal triangulations
• A lower bound for -skeleton belonging to minimum weight triangulations
• On -skeleton as a subgraph of the minimum weight triangulation
• The drawability problem for minimum weight triangulations
• Constrained independence system and triangulations of planar point sets
• A better subgraph of the minimum weight triangulation
• A study of the LMT-skeleton
• A new subgraph of minimum weight triangulations
• The strength of weak proximity
• Steiner reducing sets of minimum weight triangulations: Structure and topology

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1327172)