Advertisement

Construction of an Approximate 3D Orthogonal Convex Skull

  • Nilanjana KarmakarEmail author
  • Arindam Biswas
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9667)

Abstract

Orthogonal convex skull of a 3D digital object is a maximal volume orthogonal convex polyhedron lying entirely inside the object. An efficient combinatorial algorithm to construct an approximate 3D orthogonal convex skull of a digital object is presented in this paper. The 3D orthogonal inner cover, an orthogonal polyhedron which tightly inscribes the digital object, is divided into slab polygons and 2D orthogonal skulls of these slab polygons are combined together using combinatorial techniques to obtain an approximate 3D orthogonal convex skull. The algorithm operates in integer domain and requires at most two passes. The current version of the algorithm deals with non-intersecting objects free from holes and cavities. Experimentation on a wide range of digital objects has provided expected results, some of which are presented here to demonstrate the efficacy of the algorithm.

Keywords

Approximate 3D orthogonal convex skull Orthogonal slicing 3D orthogonal inner cover 3D concavity 

Notes

Acknowledgement

A part of this research is funded by CSIR, Govt. of India.

References

  1. 1.
    Abello, J.M., Pardalos, P.M., Resende, M.G.C. (eds.): Handbook of Massive Data Sets, vol. I. Springer, Heidelberg (2002)zbMATHGoogle Scholar
  2. 2.
    Aronov, B., van Kreveld, M., Löffler, M., Silveira, R.I.: Peeling meshed potatoes. Algorithmica 60(2), 349–367 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Borgefors, G., Strand, R.: An approximation of the maximal inscribed convex set of a digital object. In: Roli, F., Vitulano, S. (eds.) ICIAP 2005. LNCS, vol. 3617, pp. 438–445. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  4. 4.
    Cabello, S., Cibulka, J., Kynčl, J., Saumell, M., Valtr, P.: Peeling potatoes near-optimally in near-linear time. In: Proc. 13th Annual Symposium on Computational Geometry, SOCG 2014, Kyoto, Japan. pp. 224–231. ACM, New York (2014)Google Scholar
  5. 5.
    Chang, J., Yap, C.: A polynomial solution for potato-peeling and other polygon inclusion and enclosure problems. In: Proceedings of the 25th Annual Symposium on Foundations of Computer Science, SFCS 1984, Singer Island, Florida, pp. 408–416. IEEE Computer Society, Washington, DC (1984)Google Scholar
  6. 6.
    Chang, J., Yap, C.: A polynomial solution for the potato-peeling problem. Discrete Comput. Geom. 1(2), 155–182 (1986)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Chassery, J.M., Coeurjolly, D.: Optimal shape and inclusion. In: Ronse, C., Najman, L., Decenciére, E. (eds.) Mathematical Morphology: 40 Years On. Computational Imaging and Vision, vol. 30, pp. 229–248. Springer, Netherlands (2005)CrossRefGoogle Scholar
  8. 8.
    Dutt, M., Biswas, A., Bhowmick, P., Bhattacharya, B.B.: On finding an orthogonal convex skull of a digital object. Int. J. Imaging Syst. Technol. 21, 14–27 (2011)CrossRefGoogle Scholar
  9. 9.
    Goodman, J.E.: On the largest convex polygon contained in a non-convex \(n\)-gon, or how to peel a potato. Geometriae Dedicata 11(1), 99–106 (1981)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    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)CrossRefGoogle Scholar
  11. 11.
    Klette, R., Rosenfeld, A.: Digital Geometry: Geometric Methods for Digital Picture Analysis. Morgan Kaufmann, San Francisco (2004)zbMATHGoogle Scholar
  12. 12.
    Woo, T.: The convex skull problem. Technical report, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI (1986)Google Scholar
  13. 13.
    Wood, D., Yap, C.K.: The orthogonal convex skull problem. Discrete Comput. Geom. 3(4), 349–365 (1988)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

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

Personalised recommendations