Shortest path in a multiply-connected domain having curved ...

[9] Gershon Elber and Myung-Soo Kim. Geometric constraint solver using multivariate
rational spline functions. In Proceedings of the sixth ACM symposium on Solid modeling
and applications, SMA ’01, pages 1–10, New York, NY, USA, 2001. ACM.
[10] P Fabel. ”shortest” arcs in closed planar disks vary continuously with the boundary.
Topology and its Applications, 95:75–83(9), 23 June 1999.
[11] D. T. Lee and F. P. Preparata. Euclidean shortest paths in the presence of rectilinear
barriers. Networks, 14(3):393–410, 1984.
[12] Haibin Ling and David W. Jacobs. Shape classification using the inner-distance. IEEE
Trans. Pattern Anal. Mach. Intell., 29(2):286–299, 2007.
[13] Elefterios A. Melissaratos and Diane L. Souvaine. Shortest paths help solve geometric
optimization problems in planar regions. SIAM J. Comput., 21(4):601–638, 1992.
[14] Joseph S. B. Mitchell. Shortest paths among obstacles in the plane. In Proceedings of
the ninth annual symposium on Computational geometry, SCG ’93, pages 308–317, New
York, NY, USA, 1993. ACM.
[15] Les Piegl and Wayne Tiller. The NURBS book (2nd ed.). Springer-Verlag New York,
Inc., New York, NY, USA, 1997.
[16] Michel Pocchiola and Gert Vegter. Computing the visibility graph via pseudotriangulations.
In Proceedings of the eleventh annual symposium on Computational geometry,
SCG ’95, pages 248–257, New York, NY, USA, 1995. ACM.
[17] H Pottmann, M Hofer, T Steiner, and W Wang. Industrial geometry: recent advances
and applications in cad. Computer-Aided Design, 37(7):751–766, 2005.
[18] S. Bharath Ram and M. Ramanathan. The shortest path in a simply-connected domain
having a curved boundary. Computer-Aided Design, 43(8):923–933, 2011.
[19] James A. Storer and John H. Reif. Shortest paths in the plane with polygonal obstacles.
J. ACM, 41:982–1012, September 1994.
[20] Yen-hsi Richard Tsai. Rapid and accurate computation of the distance function using
grids. J. Comput. Phys., 178(1):175–195, May 2002.
[21] Franz-Erich Wolter. Cut loci in bordered and unbordered Riemannian manifolds. PhD
thesis, Technical University of Berlin, Department of Mathematics, Germany, December
1985.
[22] H. Zhao. A fast sweeping method for eikonal equations. Mathematics of Computation,
74:603–627, 2005.
17