Show simple item record

dc.contributor.authorRuiz Velázquez, Lesvia Elena 15:17:22 (GMT) 15:17:22 (GMT)
dc.description.abstractThis thesis deals with planar drawings of planar graphs such that each interior face has a prescribed area. Our work is divided into two main sections. The rst one deals with straight-line drawings and the second one with orthogonal drawings. For straight-line drawings, 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. For orthogonal drawings, we give an algorithm to draw triconnected planar graphs with maximum degree 3. This algorithm produces a drawing with at most 8 bends per face and 4 bends per edge, which improves the previous known result of 34 bends per face. Both vertices and bends have rational coordinates if the face areas are rational.en
dc.publisherUniversity of Waterlooen
dc.subjectgraph drawingen
dc.subjectprescribed face areaen
dc.titleDrawing planar graphs with prescribed face areasen
dc.typeMaster Thesisen
dc.comment.hiddenPart of this thesis was published in Graph Drawing 2009. Permission has been obtained from the publisher, they didn't ask for written permission to be in the thesis. They just asked for the publication to be mentioned in the references section, which has been done.en
dc.subject.programComputer Scienceen of Computer Scienceen
uws-etd.degreeMaster of Mathematicsen

Files in this item


This item appears in the following Collection(s)

Show simple item record


University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages