The drawability problem for minimum weight triangulations

DOI10.1016/S0304-3975(00)00383-2zbMath0984.68170DBLPjournals/tcs/LenhartL02WikidataQ62042626 ScholiaQ62042626MaRDI QIDQ5958308

William J. Lenhart, Giuseppe Liotta

Publication date: 3 March 2002

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

zbMATH Keywords

triangulationscomputational geometrygraph drawing

Mathematics Subject Classification ID

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

Related Items (3)

The strength of weak proximity ⋮ Polynomial area bounds for MST embeddings of trees ⋮ Voronoi drawings of trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Toughness and Delaunay triangulations
• Realizability of Delaunay triangulations
• A note on Delaunay and optimal triangulations
• Computing the minimum weight triangulation of a set of linearly ordered points
• Transitions in geometric minimum spanning trees
• Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation
• Computing a subgraph of the minimum weight triangulation
• Drawing outerplanar minimum weight triangulations
• A large subgraph of the minimum weight triangulation
• A linear-time approximation scheme for minimum weight triangulation of convex polygons
• Triangulations intersect nicely
• The realization problem for Euclidean minimum spanning trees is NP-hard
• Characterizing proximity trees
• A New Heuristic for Minimum Weight Triangulation
• Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation
• Angles of Planar Triangular Graphs
• Computing proximity drawings of trees in the 3-dimensional space

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