Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, CCCG 2010

Volumn , Issue , 2010, Pages 175-178

  Pan, Xiuxia ^a   Li, Fajie ^a   Klette, Reinhard ^b  

^a HUAQIAO UNIVERSITY   (China)

^b UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX POLYGON; END POINTS; NUMERICAL ACCURACY; ORDERED SET; SHORTEST PATH; SHORTEST PATH ALGORITHMS; SIMPLE POLYGON; TWO-POINT;

APPROXIMATION ALGORITHMS; COMPUTATIONAL GEOMETRY; GRAPH THEORY; SET THEORY;

PROBLEM SOLVING;

EID: 84866565871     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. M. Dror, A. Efrat, A. Lubiw, and J. Mitchell. Touring a sequence of polygons. In Proc. STOC, pages 473-482, 2003.
2. D. S. Hochbaum (editor). Approximation Algorithms for NP-Hard Problems. PWS Pub. Co., Boston, 1997.
3. R. Klette and A. Rosenfeld. Digital Geometry. Morgan Kaufmann, San Francisco, 2004.
4. F. Li and R. Klette. Rubberband algorithms for solving various 2D or 3D shortest path problems. Invited talk, in IEEE Proc. Computing: Theory and Applications, The Indian Statistical Institute, Kolkata, pages 9 - 18, 2007.
5. F. Li and R. Klette. Watchman Route in a Simple Polygon with a Rubberband Algorithm (download source of Algorithm 1), MI-tech report-51. www.mi.auckland.ac.nz/index.php?option=com-content&view=article&id= 127&Itemid=113.
6. A. Melkman. On-line construction of the convex hull of a simple polygon. Information Processing Letters, 25:11- 12, 1987.