<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T06:19:40Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/5481" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/5481</identifier><datestamp>2017-03-21T18:44:43Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9930</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="7afbb837-9b94-40cf-8139-7319fc4b3c00" confidence="600">Ruiz Velázquez, Lesvia Elena</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2010-09-08T15:17:22Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2010-09-08T15:17:22Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2010-09-08T15:17:22Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2010</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/5481</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">This thesis deals with planar drawings of planar graphs such that each interior face has&#xd;
a prescribed area.&#xd;
Our work is divided into two main sections. The  rst one deals with straight-line drawings&#xd;
and the second one with orthogonal drawings.&#xd;
For straight-line drawings, it was known that such drawings exist for all planar graphs&#xd;
with maximum degree 3. We show here that such drawings exist for all planar partial 3-trees,&#xd;
i.e., subgraphs of a triangulated planar graph obtained by repeatedly inserting a vertex in&#xd;
one triangle and connecting it to all vertices of the triangle. Moreover, vertices have rational&#xd;
coordinates if the face areas are rational, and we can bound the resolution.&#xd;
For orthogonal drawings, we give an algorithm to draw triconnected planar graphs with&#xd;
maximum degree 3. This algorithm produces a drawing with at most 8 bends per face and&#xd;
4 bends per edge, which improves the previous known result of 34 bends per face. Both&#xd;
vertices and bends have rational coordinates if the face areas are rational.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">graph drawing</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">planar</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">prescribed face area</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Computer Science</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Drawing planar graphs with prescribed face areas</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="comment" qualifier="hidden" lang="en">Part of this thesis was published in Graph Drawing 2009. Permission has been obtained from the publisher, they didn&amp;apos;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.</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">School of Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>