Short and smooth polygonal paths

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1380, Issue , 1998, Pages 151-162

  Abello, James ^a   Gansner, Emden ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AESTHETIC PROPERTY; BEZIER SPLINES; BOUNDARY SHAPES; COLLISION-FREE; EUCLIDEAN PATH; POLYGONAL PATH; POLYGONAL SHAPES; SIMPLE POLYGON;

GRAPH THEORY;

EID: 84949226809     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0054318     Document Type: Conference Paper

References (18)

1. J. Abello, O. Egecioglu, K. Kumar, "Visibility Graphs of Staircase Polygons and the Weak Bruhat Order I: From Polygons to Maximal Chains," Discrete and Computational Geometry, Vol. 14, No. 3, 1995, pp. 331-358.
2. J. Abello, K. Kumar, "Visibility Graphs and Oriented Matroids," In R. Tamassia, I. Tollis, editors, Symposium on Graph Drawing GD'94, Princeton, Lecture Notes in Computer Science, Vol. 894, 1994, pp. 147-158.
3. R. Bartels, J. Beatty, B. Barsky, An Introduction to Splines for Use in Computer Graphics and Geometric Modeling, Morgan Kaufman, Los Altos, California, 1987.
4. D. P. Dobkin, E. Gansner, E. Koutsofios, S. C. North, "Implementing a general-purpose edge router, " To appear in, Proceedings of the Symposium on Graph Drawing GD'97, Rome, Sept. 1997.
5. L. E. Dubis. "On Curves of minimal length with a constraint on average curvature and with prescribed initial and terminal positions and tangents, " Amer. J. Math., 79:497-516, 1957.
6. S. Fortune and G. Wilfong, "Planning constraint motion," In Proc. 20th Annu. ACM Sympos. Theory Comput., pp. 445-459, 1988.
7. E. R. Gansner, E. Koutsofios, S.C. North and K.P. Vo, "A technique for drawing directed graphs, " IEEE Transactions on Software Engineering, March 1993.
8. S. K. Ghosh and D. M. Mount, "An output-sensitive algorithm for computing visibility graphs", Siam J. Computing, 20(5):888-910, 1991.
9. J. Hershberger and S. Suri, "Efficient computation of Euclidean shortest paths in the plane," In Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci., pp. 508-517, 1993.
10. Y. Kanayama and B. I. Hartman, "Smooth local path planning for autonomous vehicles, " In Proc. IEEE Intl. Con, on Robotics and Automation, Vol. 3, pp. 1265-1270, 1989.
11. J.C. Latombe, Robot Motion Planning, Kluwer Academic Publishers, Boston, 1991.
12. J. P. Laumond, "Finding collision free smooth trajectories for a non-holonomic mobile robot, " In Proc. IEEE Intl. Join Conf. on Artificial Intelligence, pp. 1120-1123, 1987.
13. J. O'Rourke, "The Computational Geometry Column," SIGACT News, 1992.
14. J. O'Rourke, I. Streinu, "Pseudo Visibility Graphs," Proc. ACM Symposium on Computational Geometry, June 1997, France.
15. F. Preparata, M. Shamos, Computational Geometry: An Introduction, Springer Verlag, NY, 1995.
16. J. A. Reeds and L. A. Shepp, "Optimal paths for a car that goes both forward and backwards, " Pacific Journal of Mathematics,, 145(2), 1990.
17. G. Sander, M. Alt, A. Ferdinand, and R. Wilhelm, "Clax, a visualized Compiler, " In F. J. Brandenburg, editor, Symposium on Graph Drawing GD'95, Vol. 1027 of Lecture Notes in Computer Science, pp. 459-462, 1996.
18. J. T. Schwartz and M. Sharir, "Algorithmic motion planning in robotics," In J. van Leeuwen, editor, Algorithms and Complexity, Vol A of Handbook of Theoretical Computer Science, pp. 391-430. Elsevier, Amsterdam, 1990.