论文信息 - On computing Fréchet distance of two paths on a convex polyhedron - 字舞流文

On computing Fréchet distance of two paths on a convex polyhedron

We present a polynomial time algorithm for computing Frechet distance between two simple paths on the surface of a convex polyhedron.

Anil Maheshwari | Jiehua Yi | A. Maheshwari | Jiehua Yi

[1] Ruei-Chuan Chang,et al. Finding All Shortest Path Edge Sequences on a Convex Polyhedron , 1989, WADS.

[2] Helmut Alt,et al. Computing the Fréchet distance between two polygonal curves , 1995, Int. J. Comput. Geom. Appl..

[3] Michael Godau,et al. A Natural Metric for Curves - Computing the Distance for Polygonal Chains and Approximation Algorithms , 1991, STACS.

[4] Yijie Han,et al. Shortest paths on a polyhedron , 1990, SCG '90.

[5] Micha Sharir,et al. On shortest paths in polyhedral spaces , 1986, STOC '84.

[6] Jörg-Rüdiger Sack,et al. Determining approximate shortest paths on weighted polyhedral surfaces , 2005, JACM.

[7] Helmut Alt,et al. Matching Polygonal Curves with Respect to the Fréchet Distance , 2001, STACS.

[8] Günter Rote,et al. Matching planar maps , 2003, SODA '03.