<ctx:context-object xmlns:xsi="http://www.w3.org/2001/XML" xmlns:ctx="info:ofi/fmt:xml:xsd:ctx" timestamp="2008-09-18T11:09:04Z" xsi:schemaLocation="info:ofi/fmt:xml:xsd:ctx http://www.openurl.info/registry/docs/info:ofi/fmt:xml:xsd:ctx"><ctx:referent><ctx:identifier>info:oai:generic.eprints.org:778</ctx:identifier><ctx:metadata-by-val><ctx:format>info:ofi/fmt:xml:xsd:oai_dc</ctx:format><ctx:metadata><oai_dc:dc xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/">
        <dc:title>Straight-line drawing of quadrangulations</dc:title>
        <dc:creator>Fusy, Eric</dc:creator>
        <dc:subject>P.720 Straight-line</dc:subject>
        <dc:description>This article introduces a straight-line drawing algorithm for&#13;
quadrangulations, in the family of the face-counting algorithms. It&#13;
outputs in linear time a drawing on a regular W x H grid such that&#13;
W+H=n-1-Delta, where n is the number of vertices and Delta is&#13;
an explicit combinatorial parameter of the quadrangulation.&#13;
    </dc:description>
        <dc:publisher>Springer</dc:publisher>
        <dc:contributor>Kaufmann, Michael</dc:contributor>
        <dc:contributor>Wagner, Dorothea</dc:contributor>
        <dc:date>2007</dc:date>
        <dc:type>Conference Paper</dc:type>
        <dc:type>NonPeerReviewed</dc:type>
        <dc:identifier>Fusy, Eric (2007) Straight-line drawing of quadrangulations. [Conference Paper]</dc:identifier>
        <dc:relation>http://gdea.informatik.uni-koeln.de/778/</dc:relation></oai_dc:dc></ctx:metadata></ctx:metadata-by-val></ctx:referent></ctx:context-object>