Anchored Drawings of Planar GraphsAngelini, Patrizio and Da Lozzo, Giordano and Di Bartolomeo, Marco and Di Battista, Giuseppe and Hong, SeokHee and Patrignani, Maurizio and Roselli, Vincenzo (2014) Anchored Drawings of Planar Graphs. In: Graph Drawing 22nd International Symposium, GD 2014, September 2426, 2014 , pp. 404415(Official URL: http://dx.doi.org/10.1007/9783662458037_34). Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/9783662458037_34
AbstractIn this paper we study the Anchored Graph Drawing (AGD) problem: Given a planar graph G, an initial placement for its vertices, and a distance d, produce a planar straightline drawing of G such that each vertex is at distance at most d from its original position. We show that the AGD problem is NPhard in several settings and provide a polynomialtime algorithm when d is the uniform distance L ∞ and edges are required to be drawn as horizontal or vertical segments.
Actions (login required)
