The utility of untangling

DOI10.1007/978-3-319-27261-0_27MaRDI QIDQ5892273zbMATH OpenOpenAlexFDO

Authors Vida Dujmović

Publication date 10 February 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-27261-0_27

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• The utility of untangling
• Untangling polygons and graphs
• Upper Bound Constructions for Untangling Planar Geometric Graphs
• Untangling polygons and graphs
• Upper bound constructions for untangling planar geometric graphs

Cited in

(3)

• Small universal point sets for \(k\)-outerplanar graphs
• Drawing planar graphs with many collinear vertices
• The utility of untangling

This page was built for publication: The utility of untangling

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