Drawing Planar 3-Trees with Given Face-Areas

  • Therese Biedl
  • Lesvia Elena Ruiz Velázquez
Conference paper

DOI: 10.1007/978-3-642-11805-0_30

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5849)
Cite this paper as:
Biedl T., Ruiz Velázquez L.E. (2010) Drawing Planar 3-Trees with Given Face-Areas. In: Eppstein D., Gansner E.R. (eds) Graph Drawing. GD 2009. Lecture Notes in Computer Science, vol 5849. Springer, Berlin, Heidelberg


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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Therese Biedl
    • 1
  • Lesvia Elena Ruiz Velázquez
    • 1
  1. 1.David R. Cheriton School of Computer ScienceUniversity of WaterlooWaterlooCanada

Personalised recommendations