Triangulations without minimum-weight drawing

DOI10.1016/S0020-0190(00)00067-3zbMath1338.68270OpenAlexW2006234047MaRDI QIDQ294766

Boting Yang, Cao An Wang, Francis Y. L. Chin

Publication date: 16 June 2016

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

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019000000673?np=y

zbMATH Keywords

computational geometrygraph drawingminimum-weight triangulation

Mathematics Subject Classification ID

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

Related Items (2)

Polynomial area bounds for MST embeddings of trees ⋮ Voronoi drawings of trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Toughness and Delaunay triangulations
• Computing a subgraph of the minimum weight triangulation
• Algorithms for drawing graphs: An annotated bibliography
• Drawing outerplanar minimum weight triangulations
• A new subgraph of minimum weight triangulations
• Maximum weight triangulation and graph drawing

This page was built for publication: Triangulations without minimum-weight drawing