# An Iterative Algorithm for Computing Shortest Paths Through Line Segments in 3D

• Le Hong Trang
• Quynh Chi Truong
• Tran Khanh Dang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10646)

## Abstract

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.

## Keywords

Approximate solution Iterative algorithm Large data Shortest path

## Notes

### Acknowledgments

This research is funded by Ho Chi Minh City University of Technology - VNU-HCM under grant number T-KHMT-2017-49.

## References

1. 1.
Agarwal, P.K., Sharir, M., Varadarajan, K.R.: Approximating shortest paths on a convex polytope in three dimensions. J. ACM 44, 567–584 (1997)
2. 2.
Agarwal, P.K., Har-Peled, S., Karia, M.: Computing approximate shortest paths on convex polytopes. Algorithmica 33(2), 227–242 (2002)
3. 3.
Chen, J., Han, Y.: Shortest paths on a polyhedron. Int. J. Comput. Geom. Appl. 6, 127–144 (1996)
4. 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. 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
6. 6.
Melissaratos, E.A., Souvaine, D.L.: Shortest paths helps solve geometric optimization problems in planar regions. SIAM J. Comput. 21, 601–638 (1992)
7. 7.
Mitchell, J.S.B.: Geometric shortest paths and network optimization. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 633–701. Elsevier Science B.V, Amsterdam (2000)
8. 8.
Mitchell, J.S.B., Mount, D.M., Papadimitriou, C.H.: The discrete geodesic problem. SIAM J. Comput. 16(4), 647–668 (1987)
9. 9.
Papadimitriou, C.H.: An algorithm for shortest-path motion in three dimensions. Inf. Process. Lett. 20(5), 259–263 (1985)
10. 10.
Quynh, D.T.P., He, Y., Xin, S.-Q., Chen, Z.: An intrinsic algorithm for computing geodesic distance fields on triangle meshes with holes. Graph. Models 74(4), 209–220 (2012)
11. 11.
Schreiber, Y.: Euclidean shortest paths on polyhedra in three dimensions. Ph.D. thesis, Tel Aviv University (2007)Google Scholar
12. 12.
Sharir, M., Schorr, A.: On shortest paths in polyhedral spaces. SIAM J. Comput. 15(1), 193–215 (1986)
13. 13.
Pham-Trong, V., Szafran, N., Biard, L.: Pseudo-geodesics on three-dimensional surfaces and pseudo-geodesic meshes. Numer. Algorithms 26, 305–315 (2001)
14. 14.
Xin, S.-Q., Wang, G.-J.: Efficiently determining a locally exact shortest path on polyhedral surfaces. Comput. Aided Des. 39, 1081–1090 (2007)

© Springer International Publishing AG 2017

## Authors and Affiliations

• Le Hong Trang
• 1
Email author
• Quynh Chi Truong
• 1
• Tran Khanh Dang
• 1
1. 1.Faculty of Computer Sicence and EngineeringHo Chi Minh City University of TechnologyHo Chi Minh CityVietnam