Linear-Size Universal Point Sets for One-Bend Drawings

DOI10.1007/978-3-319-27261-0_35zbMath1471.68204OpenAlexW2397020174MaRDI QIDQ2959775

Maarten Löffler, Csaba D. Tóth

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_35

Mathematics Subject Classification ID

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

Related Items (3)

Upward book embeddability of \(st\)-graphs: complexity and algorithms ⋮ Small universal point sets for \(k\)-outerplanar graphs ⋮ Upward Book Embeddings of st-Graphs

This page was built for publication: Linear-Size Universal Point Sets for One-Bend Drawings