1 |
R. Inkulu and S. Kapoor, "Planar Rectilinear Shortest Path Computation Using Corridors," Computational Geometry, Vol 42, No. 9, pp. 873-884, 2009.
DOI
ScienceOn
|
2 |
B. K. Bhattacharya, G. Das, A. Mukhopadhyay, and G. arasimhan, "Optimally Computing a Shortest Weakly Visible Line Segment inside a Simple Polygon," Compur. Geom. Theory and Applications, Vol. 23, No. 1, pp. 1-29, 2002.
DOI
ScienceOn
|
3 |
R. L. Graham, "An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set," Inform. Process. Lett., Vol. 1, No. 4, pp. 132-133, 1972.
DOI
ScienceOn
|
4 |
F.P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, 1985.
|
5 |
R. Khosravi and M. Ghodsi, "Shortest Paths in Simple Polygons with Polygon-Meet Constraints," Information Processing Letters, Vol. 91, No. 4, pp. 171-176, 2004.
DOI
ScienceOn
|
6 |
L. Guibas, J. Hershberger, D. Leven, M. Shrir, and R. Tarjan, "Linear Time Algorithm for Visibility and Shortest Path Problems inside Triangulated Simple Polygons," Algorithmica, Vol. 2, No. 1-4, pp. 209-233, 1987.
DOI
ScienceOn
|
7 |
B. Chazelle, "Triangulating a Simple Polygon in Linear Time," Discrete Comput. Geom., Vol. 6, No. 1, pp. 485-524, 1991.
DOI
|
8 |
J. O'rourke, Art Gallery Theorems and Algorithms, Oxford Univ. Press, 1987.
|
9 |
S.-Q. Xin and G.-J. Wang, "Efficiently Determining a Locally Exact Shortest Path on Polyhedral Surfaces," Computer-Aided Design, Vol. 39, No. 12, pp. 1081-1090, 2007.
DOI
ScienceOn
|