Skip to main content
SpringerLink
Log in
Book cover

International Symposium Computational Modeling of Objects Represented in Images

CompIMAGE 2016: Computational Modeling of Objects Presented in Images. Fundamentals, Methods, and Applications pp 65–78Cite as

Finding Shortest Isothetic Path Inside a 3D Digital Object

  • Conference paper
  • First Online:

  • 492 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 10149))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  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. 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

    Chapter  Google Scholar 

  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. Hadlock, F.: A shortest path algorithm for grid graphs. Networks 7(4), 323–334 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  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. 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

    Chapter  Google Scholar 

  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. Klette, R., Rosenfeld, A.: Digital Geometry: Geometric Methods for Digital Picture Analysis. Elsevier, Amsterdam (2004)

    MATH  Google Scholar 

  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

    Chapter  Google Scholar 

  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)

    Article  Google Scholar 

  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. O’Rourke, J.: Computational Geometry in C. Cambridge University Press, Cambridge (1998)

    Book  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgement

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

Author information

Authors and Affiliations

  1. Department of Information Technology, Indian Institute of Engineering Science and Technology, Shibpur, Howrah, 711103, West Bengal, India

    Debapriya Kundu & Arindam Biswas

Authors
  1. Debapriya Kundu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arindam Biswas
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Arindam Biswas .

Editor information

Editors and Affiliations

  1. State University of New York at Fredonia , Fredonia, New York, USA

    Reneta P. Barneva

  2. State University of New York , Buffalo, New York, USA

    Valentin E. Brimkov

  3. Universidade do Porto , Porto, Portugal

    João Manuel R.S. Tavares

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Kundu, D., Biswas, A. (2017). Finding Shortest Isothetic Path Inside a 3D Digital Object. In: Barneva, R., Brimkov, V., Tavares, J. (eds) Computational Modeling of Objects Presented in Images. Fundamentals, Methods, and Applications. CompIMAGE 2016. Lecture Notes in Computer Science(), vol 10149. Springer, Cham. https://doi.org/10.1007/978-3-319-54609-4_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-54609-4_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-54608-7

  • Online ISBN: 978-3-319-54609-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation