Grid straight-line embeddings of trees with a minimum number of bends per path
type: Item
instance of: scholarly article
title: Grid straight-line embeddings of trees with a minimum number of bends per path
author: Yanyan Li
published in: Information Processing Letters
publication date: 2021-12-14T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7444824
zbMATH Keywords: minimum number of bends
zbMATH Keywords: computational geometry
zbMATH Keywords: orthogonal embeddings
zbMATH Keywords: trees
zbMATH Keywords: dynamic programming
MaRDI profile type: Publication
full work available at URL: j.ipl.2021.106210
OpenAlex ID: W3202215052
cites work: Tree drawings revisited
cites work: On the area requirements of planar straight-line orthogonal drawings of ternary trees
cites work: A note on optimal area algorithms for upward drawings of binary trees
cites work: Spirality and Optimal Orthogonal Drawings
cites work: Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time
cites work: Q5786239
cites work: Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time
cites work: How to draw a planar graph on a grid
cites work: On the computational complexity of upward and rectilinear planarity testing
cites work: A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
cites work: An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid
cites work: On Embedding a Graph in the Grid with the Minimum Number of Bends
cites work: Universality considerations in VLSI circuits
cites work: At most single-bend embeddings of cubic graphs
DOI: 10.1016/J.IPL.2021.106210
description: scientific article; zbMATH DE number 7444824