Drawing planar graphs with few geometric primitives

DOI10.1007/978-3-319-68705-6_24zbMath1483.05183arXiv1703.01691OpenAlexW2604341771MaRDI QIDQ1687929

Gregor Hültenschmidt, Philipp Kindermann, Wouter Meulemans, André Schulz

Publication date: 4 January 2018

Full work available at URL: https://arxiv.org/abs/1703.01691

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (7)

Drawing plane triangulations with few segments ⋮ Drawing Planar Graphs with Few Geometric Primitives ⋮ An annotated review on graph drawing and its applications ⋮ Variants of the segment number of a graph ⋮ Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments ⋮ Experimental Analysis of the Accessibility of Drawings with Few Segments ⋮ Experimental Analysis of the Accessibility of Drawings with Few Segments

This page was built for publication: Drawing planar graphs with few geometric primitives