Grid straight-line embeddings of trees with a minimum number of bends per path

DOI10.1016/j.ipl.2021.106210OpenAlexW3202215052MaRDI QIDQ2059894

Yanyan Li

Publication date: 14 December 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2021.106210

zbMATH Keywords

dynamic programmingtreescomputational geometryminimum number of bendsorthogonal embeddings

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• How to draw a planar graph on a grid
• A note on optimal area algorithms for upward drawings of binary trees
• At most single-bend embeddings of cubic graphs
• A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
• An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid
• Tree drawings revisited
• On the area requirements of planar straight-line orthogonal drawings of ternary trees
• On the Computational Complexity of Upward and Rectilinear Planarity Testing
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• Universality considerations in VLSI circuits
• Spirality and Optimal Orthogonal Drawings
• Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time
• Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time

This page was built for publication: Grid straight-line embeddings of trees with a minimum number of bends per path