## Anchored Drawings of Planar Graphs
Angelini, Patrizio and Da Lozzo, Giordano and Di Bartolomeo, Marco and Di Battista, Giuseppe and Hong, Seok-Hee and Patrignani, Maurizio and Roselli, Vincenzo
(2014)
Full text not available from this repository. ## 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 straight-line drawing of G such that each vertex is at distance at most d from its original position. We show that the AGD problem is NP-hard in several settings and provide a polynomial-time algorithm when d is the uniform distance L ∞ and edges are required to be drawn as horizontal or vertical segments.
Repository Staff Only: item control page References |