Optimal Monotone Drawings of Trees

DOI10.1137/16M1080045zbMath1371.68209OpenAlexW2963529993MaRDI QIDQ5351867

Xin He, Dayu He

Publication date: 31 August 2017

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/16m1080045

zbMATH Keywords

treesgraph drawingmonotone drawing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Simple Compact Monotone Tree Drawings ⋮ Monotone drawings of \(k\)-inner planar graphs ⋮ Drawing a rooted tree as a rooted \(y\)-monotone minimum spanning tree ⋮ Monotone drawings of graphs with few directions ⋮ Drawing graphs as spanners

Cites Work

• Unnamed Item
• Nearly optimal monotone drawing of trees
• Monotone drawings of graphs with few directions
• Some results on greedy embeddings in metric spaces
• Monotone drawings of graphs with fixed embedding
• On a conjecture related to geometric routing
• Euclidean Greedy Drawings of Trees
• On Monotone Drawings of Trees
• On self-approaching and increasing-chord drawings of 3-connected planar graphs
• Monotone Grid Drawings of Planar Graphs
• Compact Monotone Drawing of Trees
• Monotone Drawings of 3-Connected Plane Graphs
• Monotone Drawings of Graphs
• An Algorithm to Construct Greedy Drawings of Triangulations

This page was built for publication: Optimal Monotone Drawings of Trees