Strongly monotone drawings of planar graphs

DOI10.4230/LIPICS.SOCG.2016.37zbMATH Open1387.68179arXiv1601.01598MaRDI QIDQ3132871FDOQ3132871

Authors: Stefan Felsner, Alexander Igamberdiev, Philipp Kindermann, Boris Klemz, Tamara Mchedlidze, Manfred Scheucher 

Publication date: 30 January 2018

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

Recommendations

• On monotone drawings of trees
• Monotone drawings of graphs
• Monotone drawings of graphs
• Monotone Drawings of Graphs with Fixed Embedding
• Monotone drawings of graphs with fixed embedding

zbMATH Keywords

planar graphsgraph drawingstrongly monotonestrictly convexprimal-dual circle packing

Mathematics Subject Classification ID

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

Cited In (9)

• On planar greedy drawings of 3-connected planar graphs
• Monotone drawings of \(k\)-inner planar graphs
• Monotone drawings of 3-connected plane graphs
• Monotone simultaneous embeddings of paths in \(d\) dimensions
• Monotone Drawings of Graphs with Fixed Embedding
• Drawing graphs as spanners
• Monotone drawings of graphs with few directions
• Good spanning trees in graph drawing
• On monotone drawings of trees

This page was built for publication: Strongly monotone drawings of planar graphs

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