Short and Smooth Polygonal Paths

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 shortest path shape. A cubic Bezier spline in the region interior provides a “short and smooth” collision free curve between the two given vertices. The obtained results appear to be aesthetically pleasant and the methods used may be of independent interest. They are elementary and implementable. Figure 7 is a sample output produced by our current implementation.

[1]  Jean-Paul Laumond,et al.  Finding Collision-Free Smooth Trajectories for a Non-Holonomic Mobile Robot , 1987, IJCAI.

[2]  Jacob T. Schwartz.  CHAPTER 8 – Algorithmic Motion Planning in Robotics , 1990 .

[3]  Yutaka Kanayama,et al.  Smooth local path planning for autonomous vehicles , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[4]  Reinhard Wilhelm,et al.  CLaX - A Visualized Compiler , 1995, Graph Drawing.

[5]  Ömer Egecioglu,et al.  Visibility graphs of staircase polygons and the weak Bruhat order, I: From visibility graphs to maximal chains , 1995, Discret. Comput. Geom..

[6]  David P. Dobkin,et al.  Implementing a General-Purpose Edge Router , 1997, Graph Drawing.

[7]  B. Barsky,et al.  An Introduction to Splines for Use in Computer Graphics and Geometric Modeling , 1987 .

[8]  Joseph O'Rourke,et al.  The Computational Geometry Column #2 , 1987, COMG.

[9]  L. Shepp,et al.  OPTIMAL PATHS FOR A CAR THAT GOES BOTH FORWARDS AND BACKWARDS , 1990 .

[10]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[11]  L. Dubins.  On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents , 1957 .

[12]  Emden R. Gansner,et al.  A Technique for Drawing Directed Graphs , 1993, IEEE Trans. Software Eng..

[13]  David M. Mount,et al.  An output sensitive algorithm for computing visibility graphs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[14]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[15]  Joseph O'Rourke,et al.  Vertex-edge pseudo-visibility graphs: characterization and recognition , 1997, SCG '97.

[16]  Micha Sharir,et al.  Algorithmic motion planning in robotics , 1991, Computer.

[17]  David M. Mount,et al.  An Output Sensitive Algorithm for Computing Visibility Graphs , 1987, FOCS.

[18]  James Abello,et al.  Visibility Graphs and Oriented Matroids , 1994, GD.

[19]  Gordon T. Wilfong,et al.  Planning constrained motion , 1988, STOC '88.

[20]  Subhash Suri,et al.  Efficient computation of Euclidean shortest paths in the plane , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.