Finding Shortest Isothetic Path Inside a 3D Digital Object

  • Debapriya Kundu
  • Arindam BiswasEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10149)


The problem of finding shortest isothetic path between two points is well studied in the context of two dimensional objects. But it is relatively less explored in higher dimensions. An algorithm to find a shortest isothetic path between two points of a 3D object is presented in this paper. The object intersects with some axis parallel equi-distant slicing planes giving one or more isothetic polygons. We call these polygons as slices. The slice containing the source and destination points are called source and destination slice respectively. A graph is constructed by checking the overlap among the slices on consecutive planes. We call it slice overlap graph. Our algorithm first finds the source and destination slice. Thereafter, it finds the minimum set of slices \({\varPi }_{st}\) from the slice overlap graph, that need to be traversed to find SIP. Finally BFS is applied to find a SIP through these set of slices. The advantage of this procedure is that it does not search the whole object to find a SIP, rather only a part of the object is considered, therefore making the search faster.


Unit grid cube (UGC) Shortest isothetic path (SIP) Breadth first search (BFS) 



This research is funded by All India Council for Technical Education, Government of India.


  1. 1.
    Bajaj, C.: An efficient parallel solution for Euclidean shortest path in three dimensions. In: IEEE International Conference on Robotics and Automation, Proceedings, vol. 3, pp. 1897–1900. IEEE (1986)Google Scholar
  2. 2.
    Dutt, M., Biswas, A., Bhowmick, P., Bhattacharya, B.B.: On finding shortest isothetic path inside a digital object. In: Barneva, R.P., Brimkov, V.E., Aggarwal, J.K. (eds.) IWCIA 2012. LNCS, vol. 7655, pp. 1–15. Springer, Heidelberg (2012). doi: 10.1007/978-3-642-34732-0_1 CrossRefGoogle Scholar
  3. 3.
    Fitch, R., Butler, Z., Rus, D.: 3D rectilinear motion planning with minimum bend paths. In: 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems, Proceedings, vol. 3, pp. 1491–1498. IEEE (2001)Google Scholar
  4. 4.
    Hadlock, F.: A shortest path algorithm for grid graphs. Networks 7(4), 323–334 (1977)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Jiang, K., Seneviratne, L.D., Earles, S.: Finding the 3D shortest path with visibility graph and minimum potential energy. In: Proceedings of the 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 1993, vol. 1, pp. 679–684. IEEE (1993)Google Scholar
  6. 6.
    Karmakar, N., Biswas, A., Bhowmick, P.: Fast slicing of orthogonal covers using DCEL. In: Barneva, R.P., Brimkov, V.E., Aggarwal, J.K. (eds.) IWCIA 2012. LNCS, vol. 7655, pp. 16–30. Springer, Heidelberg (2012). doi: 10.1007/978-3-642-34732-0_2 CrossRefGoogle Scholar
  7. 7.
    Khouri, J., Stelson, K.A.: An efficient algorithm for shortest path in three dimensions with polyhedral obstacles. In: American Control Conference, pp. 161–165. IEEE (1987)Google Scholar
  8. 8.
    Klette, R., Rosenfeld, A.: Digital Geometry: Geometric Methods for Digital Picture Analysis. Elsevier, Amsterdam (2004)zbMATHGoogle Scholar
  9. 9.
    Lee, D.T.: Rectilinear paths among rectilinear obstacles. In: Ibaraki, T., Inagaki, Y., Iwama, K., Nishizeki, T., Yamashita, M. (eds.) ISAAC 1992. LNCS, vol. 650, pp. 5–20. Springer, Heidelberg (1992). doi: 10.1007/3-540-56279-6_53 CrossRefGoogle Scholar
  10. 10.
    Lin, C.W., Huang, S.L., Hsu, K.C., Lee, M.X., Chang, Y.W.: Multilayer obstacle-avoiding rectilinear steiner tree construction based on spanning graphs. IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst. 27(11), 2007–2016 (2008)CrossRefGoogle Scholar
  11. 11.
    Lu, J., Diaz-Mercado, Y., Egerstedt, M., Zhou, H., Chow, S.N.: Shortest paths through 3-dimensional cluttered environments. In: 2014 IEEE International Conference on Robotics and Automation (ICRA), pp. 6579–6585. IEEE (2014)Google Scholar
  12. 12.
    O’Rourke, J.: Computational Geometry in C. Cambridge University Press, Cambridge (1998)CrossRefzbMATHGoogle Scholar
  13. 13.
    Wagner, D.P., Drysdale, R.S., Stein, C.: An O(n5/2logn) algorithm for the rectilinear minimum link-distance problem in three dimensions. Comput. Geom. 42(5), 376–387 (2009)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Department of Information TechnologyIndian Institute of Engineering Science and Technology, ShibpurHowrahIndia

Personalised recommendations