Optimal monotone drawings of trees
From MaRDI portal
Recommendations
Cites work
- An Algorithm to Construct Greedy Drawings of Triangulations
- Compact monotone drawing of trees
- Euclidean greedy drawings of trees
- scientific article; zbMATH DE number 3032896 (Why is no real title available?)
- Monotone drawings of 3-connected plane graphs
- Monotone drawings of graphs
- Monotone drawings of graphs with few directions
- Monotone drawings of graphs with fixed embedding
- Monotone grid drawings of planar graphs
- Nearly optimal monotone drawing of trees
- On a conjecture related to geometric routing
- On monotone drawings of trees
- On self-approaching and increasing-chord drawings of 3-connected planar graphs
- Some results on greedy embeddings in metric spaces
Cited in
(10)- Monotone drawings of k-inner planar graphs
- Drawing a rooted tree as a rooted \(y\)-monotone minimum spanning tree
- On monotone drawings of trees
- Compact monotone drawing of trees
- Nearly optimal monotone drawing of trees
- Simple compact monotone tree drawings
- scientific article; zbMATH DE number 2087456 (Why is no real title available?)
- Monotone drawings of graphs with few directions
- Drawing graphs as spanners
- Simple and optimal output-sensitive construction of contour trees using monotone paths
This page was built for publication: Optimal monotone drawings of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5351867)