In this paper we study the
Anchored Graph Drawing
) problem: Given a planar graph
, an initial placement for its vertices, and a distance
, produce a planar straight-line drawing of
such that each vertex is at distance at most
from its original position.
We show that the
problem is NP-hard in several settings and provide a polynomial-time algorithm when
is the uniform distance
and edges are required to be drawn as horizontal or vertical segments.