Roberto
Tamassia
Pure Mathematics
Brown University
Department of Computer Science, Brown University, 02912-1910Â Providence, RI, USA
2019-04-15T13:28
Planar drawings and angular resolution: Algorithms and bounds
1994
chapter
chapters
1994-01-01
12-23
We investigate the problem of constructing planar straightline drawings of graphs with large angles between the edges. Namely, we study the angular resolution of planar straight-line drawings, defined as the smallest angle formed by two incident edges. We prove the first nontrivial upper bound on the angular resolution of planar straight-line drawings, and show a continuous trade-off between the area and the angular resolution. We also give linear-time algorithms for constructing planar straight-line drawings with high angular resolution for various classes of graphs, such as series-parallel graphs, outerplanar graphs, and triangulations generated by nested triangles. Our results are obtained by new techniques that make extensive use of geometric constructions.
https://scigraph.springernature.com/explorer/license/
en
false
http://link.springer.com/10.1007/BFb0049393
Berlin, Heidelberg
Springer Berlin Heidelberg
dimensions_id
pub.1031647520
doi
10.1007/bfb0049393
978-3-540-58434-6
Algorithms â€” ESA '94
978-3-540-48794-4
Ashim
Garg
readcube_id
96c3609ba1d562f9122fbc4552070c6da02d3fdad4a7940dec1717d6eb3b5bd7
Jan
van Leeuwen
Springer Nature - SN SciGraph project
Mathematical Sciences