Abstract
It is well-known that every graph with maximum degree 4 has an orthogonal drawing with area at most 49/64 n2+O(n)≈0.76n2. In this paper, we show that if the graph is 3-connected, then the area can be reduced even further to9/16n2+O(n)≈0.56n2.Thedrawingusesthe 3-canonical order for (not necessarily planar) 3-connected graphs, which is a special Mondshein sequence and can hence be computed in linear time. To our knowledge, this is the first application of a Mondshein sequence in graph drawing.
Cite
CITATION STYLE
Biedl, T., & Schmidt, J. M. (2015). Small-area orthogonal drawings of 3-connected graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9411, pp. 153–165). Springer Verlag. https://doi.org/10.1007/978-3-319-27261-0_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
