Triangulations without minimum-weight drawing

DOI10.1016/S0020-0190(00)00067-3zbMATH Open1338.68270OpenAlexW2006234047MaRDI QIDQ294766FDOQ294766

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1629854
• The drawability problem for minimum weight triangulations
• scientific article; zbMATH DE number 2080112
• Drawing outerplanar minimum weight triangulations
• scientific article; zbMATH DE number 1222816

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithms for drawing graphs: An annotated bibliography
• Title not available (Why is that?)
• Computing a subgraph of the minimum weight triangulation
• Drawing outerplanar minimum weight triangulations
• A new subgraph of minimum weight triangulations
• Maximum weight triangulation and graph drawing
• Toughness and Delaunay triangulations

Cited In (7)

• Polynomial area bounds for MST embeddings of trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Voronoi drawings of trees
• A note on isosceles planar graph drawing
• Algorithms and Computation
• The drawability problem for minimum weight triangulations

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

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