Periodic planar straight-frame drawings with polynomial resolution

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present a new algorithm to compute periodic (planar) straight-line drawings of toroidal graphs. Our algorithm is the first to achieve two important aesthetic criteria: the drawing fits in a straight rectangular frame, and the grid area is polynomial, precisely the grid size is O(n 4×n 4). This solves one of the main open problems in a recent paper by Duncan et al. [3].

Original languageEnglish
Title of host publicationLATIN 2014
Subtitle of host publicationTheoretical Informatics - 11th Latin American Symposium, Proceedings
PublisherSpringer Verlag
Pages168-179
Number of pages12
ISBN (Print)9783642544224
DOIs
Publication statusPublished - 1 Jan 2014
Event11th Latin American Theoretical Informatics Symposium, LATIN 2014 - Montevideo, Uruguay
Duration: 31 Mar 20144 Apr 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8392 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference11th Latin American Theoretical Informatics Symposium, LATIN 2014
Country/TerritoryUruguay
CityMontevideo
Period31/03/144/04/14

Fingerprint

Dive into the research topics of 'Periodic planar straight-frame drawings with polynomial resolution'. Together they form a unique fingerprint.

Cite this