Recommendations
- Optimal monotone drawings of trees
- Compact monotone drawing of trees
- Simple compact monotone tree drawings
- scientific article; zbMATH DE number 1305404
- A near-linear area bound for drawing binary trees
- On monotone drawings of trees
- Order-preserving drawings of trees with approximately optimal height (and small width)
- Euclidean greedy drawings of trees
- Euclidean greedy drawings of trees
Cites work
- Algorithms for plane representations of acyclic digraphs
- An Algorithm to Construct Greedy Drawings of Triangulations
- Compact monotone drawing of trees
- Monotone Drawings of Graphs with Fixed Embedding
- Monotone drawings of graphs
- Monotone grid drawings of planar graphs
- On a conjecture related to geometric routing
- On monotone drawings of trees
- On the computational complexity of upward and rectilinear planarity testing
Cited in
(12)- Optimal monotone drawings of trees
- Simple compact monotone tree drawings
- Monotone drawings of k-inner planar graphs
- Drawing a rooted tree as a rooted \(y\)-monotone minimum spanning tree
- scientific article; zbMATH DE number 2087456 (Why is no real title available?)
- Simple and optimal output-sensitive construction of contour trees using monotone paths
- On the approximability of two tree drawing conventions
- Voronoi drawings of trees
- Rooted Uniform Monotone Minimum Spanning Trees
- Drawing Trees with Perfect Angular Resolution and Polynomial Area
- Drawing trees with perfect angular resolution and polynomial area
- Compact monotone drawing of trees
This page was built for publication: Nearly optimal monotone drawing of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344763)
