H. Alt and M. Buchin, Semi-computability of the Fréchet distance between surfaces, Proc. 21st European Workshop on Computational Geometry, pp.45-48, 2005.

H. Alt and M. Godau, Computing the Fréchet distance between two polygonal curves, Int. J. Comput. Geom. Appl, vol.5, issue.1-2, pp.75-91, 1995.

S. Ahpk-+-06]-boris-aronov, C. Har-peled, Y. Knauer, C. Wang, and . Wenk, Fréchet distance for curves, revisited, Proc. 14th European Symp. Algorithms, vol.4168, pp.52-63, 2006.

S. Bespamyatnikh, Computing homotopic shortest paths in the plane, Proc. 14th Annu. ACM-SIAM Sympos. Discrete Algorithms, pp.609-617, 2003.

S. Bespamyatnikh, Encoding homotopy of paths in the plane, Proc. LATIN 2004: Theoretical Infomatics, vol.2976, pp.329-338, 2004.

B. Chazelle, A theorem on polygon cutting with applications, Proc. 23rd Annu, pp.339-349, 1982.

E. W. Chambers, Finding Interesting Topological Features, 2008.

L. and P. Chew, Constrained Delaunay triangulations. Algorithmica, vol.4, issue.1, pp.97-108, 1989.

S. Cabello, Y. Liu, A. Mantler, and J. Snoeyink, Testing homotopy for paths in the plane, Discrete Comput. Geom, vol.31, issue.1, pp.61-81, 2004.

R. Cole, Slowing down sorting networks to obtain faster sorting algorithms, JACM, vol.34, issue.1, pp.200-208, 1987.

R. Cole, Parallel merge sort, SIAM Journal on Computing, vol.17, issue.4, pp.770-785, 1988.

F. Atlas, C. Cook, and . Wenk, Geodesic Fréchet and Hausdorff distance inside a simple polygon, 2007.

F. Atlas, C. Cook, and . Wenk, Geodesic Fréchet distance inside a simple polygon, Proc. 25th Symp. Theoretical Aspects of Computer Science (STACS), pp.193-204, 2008.

F. Atlas, C. Cook, and . Wenk, Geodesic Fréchet distance with polygonal obstacles, 2008.

. Eghp-+-02]-alon, L. J. Efrat, S. Guibas, J. S. Har-peled, T. M. Mitchell et al., New similarity measures between polylines with applications to morphing and polygon sweeping, Discrete Comput. Geom, vol.28, pp.535-569, 2002.

A. Efrat, S. G. Kobourov, and A. Lubiw, Computing homotopic shortest paths efficiently, Comput. Geom. Theory Appl, vol.35, issue.3, pp.162-172, 2006.

T. Eiter and H. Mannila, Computing discrete Fréchet distance, 1994.

L. J. Guibas and J. Hershberger, Optimal shortest path queries in a simple polygon, J. Comput. Syst. Sci, vol.39, issue.2, pp.126-152, 1989.

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, pp.17-24, 1998.

J. Hershberger, A new data structure for shortest path queries in a simple polygon, Inf. Proc. Letters, vol.38, issue.5, pp.231-235, 1991.

J. Hershberger and J. Snoeyink, Computing minimum length paths of a given homotopy class, Computational Geometry: Theory and Applications, vol.4, pp.63-67, 1994.

J. Hershberger and S. Suri, An optimal algorithm for euclidean shortest paths in the plane, SIAM Journal on Computing, vol.28, issue.6, pp.2215-2256, 1999.

D. Lee, P. Franco, and . Preparata, Euclidean shortest paths in the presence of rectilinear barriers, Networks, vol.14, pp.393-410, 1984.

N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, J. ACM, vol.30, pp.852-866, 1983.

J. Munkres and . Topology, , 2000.

A. Maheshwari and J. Yi, On computing Fréchet distance of two paths on a convex polyhedron, Proc. 21st European Workshop on Computational Geometry, pp.41-44, 2005.

M. Pocchiola and G. Vegter, Computing the visibility graph via pseudotriangulations, Symposium on Computational Geometry, pp.248-257, 1995.
DOI : 10.1145/220279.220306
URL : https://pure.rug.nl/ws/files/3276553/1995ProcSCGPocchiola.pdf

M. Pocchiola and G. Vegter, Minimal tangent visibility graphs, Computational Geometry: Theory and Applications, vol.6, 1996.
DOI : 10.1016/0925-7721(95)00016-x
URL : https://doi.org/10.1016/0925-7721(95)00016-x

R. Seidel, The nature and meaning of perturbations in geometric computing, Discrete Comput. Geom, vol.19, pp.1-17, 1998.

E. Sriraghavendra, K. Karthik, and C. Bhattacharyya, Fréchet distance based approach for searching online handwritten documents, Proc. 9th Int'l. Conf. Document Analysis and Recognition (ICDAR), pp.461-465, 2007.

R. C. René-van-oostrum and . Veltkamp, Parametric search made practical, Computational Geometry: Theory and Applications, vol.28, pp.75-88, 2004.