Compact Monotone Drawing of Trees

DOI10.1007/978-3-319-21398-9_36zbMath1465.68212OpenAlexW2275335675MaRDI QIDQ3196406

Xin He, Dayu He

Publication date: 29 October 2015

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-21398-9_36

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Trees (05C05) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (4)

Nearly optimal monotone drawing of trees ⋮ Optimal Monotone Drawings of Trees ⋮ Simple Compact Monotone Tree Drawings ⋮ Monotone drawings of \(k\)-inner planar graphs

Cites Work

• Some results on greedy embeddings in metric spaces
• Algorithms for plane representations of acyclic digraphs
• On a conjecture related to geometric routing
• On the Computational Complexity of Upward and Rectilinear Planarity Testing
• On Monotone Drawings of Trees
• Monotone Grid Drawings of Planar Graphs
• Monotone Drawings of Graphs
• An Algorithm to Construct Greedy Drawings of Triangulations

This page was built for publication: Compact Monotone Drawing of Trees