Anchored Drawings of Planar Graphs
In 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.
Unable to display preview. Download preview PDF.
- 1.Abellanas, M., Aiello, A., Hernández, G., Silveira, R.I.: Network drawing with geographical constraints on vertices. In: Actas XI Encuentros de Geom. Comput., pp. 111–118 (2005)Google Scholar
- 9.Lyons, K.A., Meijer, H., Rappaport, D.: Algorithms for cluster busting in anchored graph drawing. J. Graph Algorithms Appl. 2(1) (1998)Google Scholar