Rubberband algorithms for solving various 2D or 3D shortest path problems

Proceedings - International Conference on Computing: Theory and Applications, ICCTA 2007

Volumn , Issue , 2007, Pages 9-18

  Li, Fajie ^a   Klette, Reinhard ^a  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; NUMERICAL METHODS; OPTIMIZATION; PROBLEM SOLVING;

EUCLIDEAN SHORTEST PATH (ESP) PROBLEMS; MINIMUM-LENGTH POLYGONAL CURVES; RUBBERBAND ALGORITHMS; SHORTEST PATH PROBLEMS;

MOTION PLANNING;

EID: 34547359875     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCTA.2007.113     Document Type: Conference Paper

References (23)

1. T. Bülow and R. Klette. Digital curves in 3D space and a linear-time length estimation algorithm. IEEE Trans. Pattern Analysis Machine Intelligence, 24:962-970, 2002.
2. J. Canny and J. H. Reif. New lower bound techniques for robot motion planning problems. In Proc. IEEE Conf Foundations Computer Science, pages 49-60, 1987.
3. W.-P. Chin and S. Ntafos. The zookeeper route problem. Information Sciences, 63:245-259, 1992.
4. J. Choi, J. Sellen, and C.-K. Yap. Approximate Euclidean shortest path in 3-space. In Proc. ACM Conf. Computational Geometry, ACM Press, pages 41-48, 1994.
5. M. Dror, A. Efrat, A. Lubiw, and J. Mitchell. Touring a sequence of polygons. In Proc. STOC, pages 473-482, 2003.
6. D. S. Hochbaum (editor). Approximation Algorithms for NP-Hard Problems. PWS Pub. Co.,Boston, 1997.
7. J. Hoeft and U. S. Palekar. Heuristics for the plate-cutting traveling salesman problem. IIE Transactions, 29:719-731, 1997.
8. M. I. Karavelas and L. J. Guibas. Static and kinetic geometric spanners with applications. In Proc. ACM-SIAM Symp. Discrete Algorithms, pages 168-176, 2001.
9. R. Klette and T. Billow. Critical edges in simple cube-curves. In Proc. Discrete Geometry Computational Imaging, LNCS 1953, pages 467-478, Springer, Berlin, 2000.
10. R. Klette and A. Rosenfeld. Digital Geometry. Morgan Kaufmann, San Francisco, 2004.
11. F. Li and R. Klette. Minimum-length polygon of a simple cube-curve in 3D space. In Proc. Int. Workshop Combinatorial Image Analysis, LNCS 3322, pages 502-511, Springer, Berlin, 2004.
12. F. Li and R. Klette. The class of simple cube-curves whose MLPs cannot have vertices at grid points. In Proc. Discrete Geometry Computational Imaging, LNCS 3429, pages 183-194, Springer, Berlin, 2005.
13. F. Li and R. Klette. Analysis of the rubberband algorithm. Image and Vision Computing, to appear.
14. F. Li and R. Klette. Shortest paths in a cuboidal world. In Proc. Int. Workshop Combinatorial Image Analysis, LNCS 4040, pages 415-429, Springer, Berlin, 2006.
15. F. Li and R. Klette. Exact and approximate algorithms for the calculation of shortest paths. Report 2141 on www.ima.umn.edu/preprints/oct2006
16. J. S. B. Mitchell. Geometric shortest paths and network optimization. In Handbook of Computational Geometry (J.-R. Sack and J. Urrutia, editors), pages 633-701, Elsevier, 2000.
17. J. S. B. Mitchell and M. Sharir. New results on shortest paths in three dimensions. In Proc. SCG, pages 124-133, 2004.
18. S. Ntafos. Watchman routes under limited visibility. Comput. Geom., 1:149-170, 1992.
19. J. Sklansky and D. F. Kibler. A theory of nonuniformly digitized binary pictures. IEEE Trans. Systems Man Cybernetics, 6:637-647, 1976.
20. F. Sloboda, B. Zaťko, and R. Klette. On the topology of grid continua. In Proc. Vision Geometry, SPIE 3454, pages 52-63, 1998.
21. X. Tan. Fast computation of shortest watchman routes in simple polygons. Information Processing Letters, 77:27-33, 2001.
22. X. Tan. Linear-time 2-approximation algorithm for the watchman route problem. In Proc. Theory Applications Models Computation, LNCS 3959, pages 181-191, Springer, Berlin, 2006.
23. M. Talbot. A dynamical programming solution for shortest path itineraries in robotics. Electr. J. Undergrad. Math., 9:21-35, 2004.