Drawing Planar 3-Trees with Given Face-Areas

Biedl, Therese and Ruiz Velázquez, Lesvia Elena (2010) Drawing Planar 3-Trees with Given Face-Areas. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009 , pp. 316-322(Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_30).

Full text not available from this repository.


We study straight-line drawings of planar graphs such that each interior face has a prescribed area. It was known that such drawings exist for all planar graphs with maximum degree 3. We show here that such drawings exist for all planar partial 3-trees, i.e., subgraphs of a triangulated planar graph obtained by repeatedly inserting a vertex in one triangle and connecting it to all vertices of the triangle. Moreover, vertices have rational coordinates if the face-areas are rational, and we can bound the resolution. We also give some negative results for other graph classes.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-642-11805-0_30
Classifications: P Styles > P.720 Straight-line
P Styles > P.540 Planar
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1066

Actions (login required)

View Item View Item