1. Area requirement of graph drawings with few crossings per edge.
- Author
-
Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, and Montecchiani, Fabrizio
- Subjects
- *
GRAPH theory , *PLANAR graphs , *NUMBER theory , *MATHEMATICAL proofs , *ALGORITHMS , *MATHEMATICAL bounds - Abstract
Abstract: In this paper we study how to compute compact straight-line drawings of planar graphs with a limited number of crossings per edge. We prove that every outerplanar graph can be drawn in area using a sub-linear number of crossings per edge, and that for any given number , every outerplanar graph admits an area drawing with crossing per edge. The drawing algorithms run in linear time and can be also generalized to another meaningful sub-family of series–parallel graphs with bounded vertex-degree. [Copyright &y& Elsevier]
- Published
- 2013
- Full Text
- View/download PDF