An Iterative Algorithm for Computing Shortest Paths Through Line Segments in 3D
A version of the geometrical shortest path problem is to compute a shortest path connecting two points and passing a finite set of line segments in three dimensions. This problem arises in the pursuit path problem and also be used as a tool to finding shortest paths on polyhedral surface. This paper presents an iterative algorithm for dealing with the problem, particularly with large data. The idea is to simultaneously determines on each segment a point such that the length of the path successively connecting the points is decreased. We show that after a finite number of iterations, the algorithm converges to give an approximate solution. The algorithm is implemented in C++ and tested for large datasets. The numerical results are shown and discussed.
KeywordsApproximate solution Iterative algorithm Large data Shortest path
This research is funded by Ho Chi Minh City University of Technology - VNU-HCM under grant number T-KHMT-2017-49.
- 4.Cheng, S.-W., Jin, J.: Shortest paths on polyhedral surfaces and terrains. In: Proceedings of STOC1 2014, pp. 373–382 (2014)Google Scholar
- 5.Hai, N.N., An, P.T., Huyen, P.T.T.: Shortest Paths along a sequence of line segments in Euclidean spaces, Preprint. http://math.ac.vn/images/Epreprint/2016/IMH20161101.pdf
- 11.Schreiber, Y.: Euclidean shortest paths on polyhedra in three dimensions. Ph.D. thesis, Tel Aviv University (2007)Google Scholar