Short and Smooth Polygonal Paths

  title={Short and Smooth Polygonal Paths},
  author={James Abello and Emden R. Gansner},
Automatic graph drawers need to compute paths among vertices of a simple polygon which besides remaining in the interior need to exhibit certain aesthetic properties. Some of these require the incorporation of some information about the polygonal shape without being too far from the actual shortest path. We present an algorithm to compute a locally convex region that “contains” the shortest Euclidean path among two vertices of a simple polygon. The region has a boundary shape that “follows” the… CONTINUE READING