Walking your dog in the woods in polynomial time

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2008, Pages 101-109

  Chambers, Erin Wolf ^a   De Verdière, Éric Colin ^b   Erlckson, Jeff ^a   Lazard, Bylvain ^c   Lazarus, Francis ^d   Ihite, Shripad ^e  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b ECOLE NORMALE SUPÉRIEURE   (France)

^c LORIA   (France)

^d GRENOBLE INSTITUTE OF TECHNOLOGY   (France)

^e CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Geodesic leash map; Homotopic fr chet distance

Indexed keywords

GRAPH THEORY; POLYNOMIAL APPROXIMATION; SET THEORY; TOPOLOGY;

GENERAL METRIC SPACES; GEODESIC LEASH MAP; NATURAL EXTENSIONS; POLYGONAL CURVES; POLYNOMIAL TIMES; TIME ALGORITHMS;

COMPUTATIONAL GEOMETRY;

EID: 57349152307     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1377676.1377694     Document Type: Conference Paper

References (19)

1. H. Alt and M. Buchin. Semi-computability of the Frech́et distance between surfaces. Proc. 21st European Workshop on Computational Geometry, 45-48, 2005.
2. H. Alt and M. Godau. Computing the Fréchet distance between two polygonal curves. IJCGA 5(l-2):75-91, 1995.
3. S. Bespamyatnikh. Computing homotopic shortest paths in the plane. Proc. 14th Annu. ACM-SIAM Sympos. Discrete Algorithms, 609-617, 2003.
4. S. Bespamyatnikh. Encoding homotopy of paths in the plane. Proc. LATIN 2004: Theoretical Infomatics, 329-338, 2004. Lect. Notes Comput. Sci. 2976, Springer-Verlag.
5. S. Cabello, Y. Liu, A. Mantler, and J. Snoeyink. Testing homotopy for paths in the plane. Discrete Comput. Geom. 31(1):61-81, 2004.
6. B. Chazelle. A theorem on polygon cutting with applications. Proc. 23rd Annu. IEEE Sympos. Found. Comput. Sci., 339-349, 1982.
7. R. Cole. Slowing down sorting networks to obtain faster sorting algorithms. JACM 34(l):200-208, 1987.
8. R. Cole. Parallel merge sort. SIAM J. Comput. 17(4):770-785, 1988.
9. A. Cook and C. Wenk. Geodesic Fréchet and Hausdorff distance inside a simple polygon. Tech. Rep. CS-TR-2007-004, U. Texas San Antonio, 2007.
10. A. Efrat, L. J. Guibas, S. Har-Peled, J. S. B. Mitchell, and T. M. Murali. New similarity measures between polylines with applications to morphing and polygon sweeping. Discrete Comput. Geom. 28:535-569, 2002.
11. A. Efrat, S. G. Kobourov, and A. Lubiw. Computing homotopic shortest paths efficiently. Comput. Geom. Theory Appl. 35(3):162-172, 2006.
12. D. Grigoriev and A. Slissenko. Polytime algorithm for the shortest path in a homotopy class amidst semi-algebraic obstacles in the plane. Proc. Internat. Sympos. Symbolic and Algebraic Computation, 17-24, 1998.
13. J. Hershberger and J. Snoeyink. Computing minimum length paths of a given homotopy class. Computational Geometry: Theory and Applications 4:63-67, 1994.
14. J. Hershberger and S. Suri. An optimal algorithm for Euclidean shortest paths in the plane. SIAM J. Comput. 28(6):2215-2256, 1999.
15. D. T. Lee and F. P. Preparata. Euclidean shortest paths in the presence of rectilinear barriers. Networks 14:393-410, 1984.
16. A. Maheshwari and J. Yi. On computing Fréchet distance of two paths on a convex polyhedron. Proc. 21st European Workshop on Computational Geometry, 41-44, 2005.
17. N. Megiddo. Applying parallel computation algorithms in the design of serial algorithms. J. ACM 30:852-866, 1983.
18. R. van Oostrum and R. C. Veltkamp. Parametric search made practical. Computational Geometry: Theory and Applications 28:75-88, 2004.
19. R. Seidel. The nature and meaning of perturbations in geometric computing. Discrete Comput. Geom. 19:1-17, 1998.