REACHABLE GRASPS ON A POLYGON OF A ROBOT ARM: FINDING CONVEX ROPES WITHOUT TRIANGULATION

Phan Thanh An

References

  1. [1] M.A. Peshkin & A.C. Sanderson, Reachable grasps on a polygon: the convex rope algorithm, IEEE Journal on Robotics and Automation, 2(1), 1986, 53–58.
  2. [2] T. Lozano-Perez, Automatic planning of manipulator transfer movements, IEEE Transactions on Systems, Man, and Cybernetics, SMC-11 (10), 1981, 681–698.
  3. [3] R.L. Graham, An efficient algorithm for determining the convex hull of a finite planar set, Information Processing Letters, 26, 1972, 132–133.
  4. [4] A.A. Melkman, On-line construction of the convex hull of a simple polyline, Information Processing Letters, 25, 1987, 11–12.
  5. [5] G.T. Toussaint & D. Avis, On a convex hull algorithm for polygons and its application to triangulation problems, Pattern Recognition, 15, 1982, 23–29.
  6. [6] L. Guibas, J. Hershberger, D. Leven, M. Sharir, & R.E. Tarjan, Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons, Algorithmica, 2, 1987, 209–233.
  7. [7] P.J. Heffernan & J.S.B. Mitchell, Structured visibiliy profiles with applications to problems in simple polygons, Proc. 6th Annual ACM Symp. Computational Geometry, Amsterdam, 1990, 53–62.
  8. [8] M.T. Goodrich, S.B. Shauck, & S. Guha, Parallel methodsfor visibility and shortest-path problems in simple polygons, Algorithmica, 8, 1992, 461–486.
  9. [9] J.S.B. Mitchell, Geometric shortest paths and network optimization, in Handbook of Computational Geometry, J.R. Sack & J. Urrutia (Amsterdam: Eds Elsevier Science B.V., 2000), 633–701.
  10. [10] J. O’Rourke, Computational Geometry in C, Secong Edition (Cambridge University Press, 1998).
  11. [11] www.softsurfer.com
  12. [12] R.T. Rockafellar, Convex Analysis (Princeton, NJ: Princeton University Press, 1970).
  13. [13] T. Auer & M. Held, Heuristics for the generation of random polygons, in Proc. 8th Canad. Conf. Computat. Geometry, (Carleton University Press, Ottawa, Canada: F. Fiala, E. Kranakis & J.-R. Sack (Eds.)), August 12–15, 1996, 38–44.
  14. [14] P.T. An, Method of orienting curves for determining the convex hull of a finite set of points in the plane, Optimization 59(2), 2010, 175–179.
  15. [15] P.T. An, A modification of Graham’s algorithm for determining the convex hull of a finite planar set, Annales Mathematicae et Informaticae, 34, 2007, 3–8.
  16. [16] H.X. Phu, Zur Lösung einer regulären Aufgabenklasse der optimalen Steuerung im Großen mittels Orientierungskurven, Optimization, 18, 1987, 65–81.
  17. [17] H.X. Phu, Ein konstruktives Lösungsverfahren für das Problem des Inpolygons kleinsten Umfangs von J. Steiner, Optimization, 18, 1987, 349–359.
  18. [18] H.X. Phu, Zur Lösung eines Zermeloschen Navigationsprobo lems, Optimization, 18, 1987, 225–236.
  19. [19] S.G. Akl & G.T. Toussaint, A fast convex hull algorithm, Information Processing Letters 7, 1978, 219–222.

Important Links:

Go Back