@inproceedings{abfc29a2452643199fdaed6e1e4219dd,
title = "Periodic planar straight-frame drawings with polynomial resolution",
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].",
author = "\{Castelli Aleardi\}, Luca and {\'E}ric Fusy and Anatolii Kostrygin",
year = "2014",
month = jan,
day = "1",
doi = "10.1007/978-3-642-54423-1\_15",
language = "English",
isbn = "9783642544224",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "168--179",
booktitle = "LATIN 2014",
note = "11th Latin American Theoretical Informatics Symposium, LATIN 2014 ; Conference date: 31-03-2014 Through 04-04-2014",
}