The drawability problem for minimum weight triangulations

DOI10.1016/S0304-3975(00)00383-2MaRDI QIDQ5958308zbMATH OpenDBLPWikidataFDO

Authors William Lenhart, Giuseppe Liotta

Publication date 3 March 2002

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(00)00383-2

zbMATH Keywords

computational geometrygraph drawingtriangulations

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 2080112
• The minimum weight triangulation problem with few inner points
• Parameterized and Exact Computation
• Approximating minimum-weight triangulations in three dimensions
• scientific article; zbMATH DE number 1629854
• Triangulations without minimum-weight drawing
• On a linear program for minimum-weight triangulation
• On a linear program for minimum-weight triangulation
• scientific article; zbMATH DE number 742947
• Polynomial-time instances of the minimum weight triangulation problem

Cites work

• A large subgraph of the minimum weight triangulation
• A linear-time approximation scheme for minimum weight triangulation of convex polygons
• A New Heuristic for Minimum Weight Triangulation
• A note on Delaunay and optimal triangulations
• Angles of Planar Triangular Graphs
• Characterizing proximity trees
• Computing a subgraph of the minimum weight triangulation
• Computing proximity drawings of trees in the 3-dimensional space
• Computing the minimum weight triangulation of a set of linearly ordered points
• Drawing outerplanar minimum weight triangulations
• Graph theory
• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1079755 (Why is no real title available?)
• Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation
• Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation
• Realizability of Delaunay triangulations
• The realization problem for Euclidean minimum spanning trees is NP-hard
• Toughness and Delaunay triangulations
• Transitions in geometric minimum spanning trees
• Triangulations intersect nicely

Cited in

(8)

• Drawing outerplanar minimum weight triangulations
• Voronoi drawings of trees
• scientific article; zbMATH DE number 1629854 (Why is no real title available?)
• Triangulations without minimum-weight drawing
• scientific article; zbMATH DE number 2080112 (Why is no real title available?)
• Minimum weight disk triangulations and fillings
• Polynomial area bounds for MST embeddings of trees
• The strength of weak proximity

This page was built for publication: The drawability problem for minimum weight triangulations

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