Before revision: We study the algorithmic problem of computing drawings of graphs in which (i) each vertex is a disk with constant radius r , (ii) each edge is a straight-line segment connecting the centers of the two disks representing its end-vertices, (iii) no two disks intersect, and (iv) the edge-vertex resolution is at least r, that is, no edge segment intersects a non-adjacent disk .
After revision: We study the algorithmic problem of computing drawings of graphs in which (i) each vertex is a disk with constant radius r , (ii) each edge is a straight-line segment connecting the centers of the two disks representing its end-vertices, (iii) no two disks intersect, and (iv) the distance between an edge segment and the center of a non-incident disk, called .