Drawing planar 3-trees with given face-areas
| dc.contributor.author | Biedl, Therese | |
| dc.contributor.author | Velazquez, Lesvia Elena Ruiz | |
| dc.date.accessioned | 2026-10-01T18:24:45Z | |
| dc.date.issued | 2009-06-04 | |
| dc.description.abstract | 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. 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. | |
| dc.identifier.uri | https://hdl.handle.net/10012/24470 | |
| dc.language.iso | en | |
| dc.publisher | University of Waterloo | |
| dc.relation.ispartofseries | Computer Science Technical Reports; CS-2009-20 | |
| dc.title | Drawing planar 3-trees with given face-areas | |
| dc.type | Technical Report | |
| uws.contributor.affiliation1 | Faculty of Mathematics | |
| uws.contributor.affiliation2 | David R. Cheriton School of Computer Science | |
| uws.peerReviewStatus | Unreviewed | |
| uws.scholarLevel | Faculty | |
| uws.typeOfResource | Text | en |