Construction of 3D Orthogonal Convex Hull of a Digital Object

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


Orthogonal convex hull of a digital object in 3D domain is defined as the minimum volume orthogonal polyhedron enclosing the object such that its intersection with an axis-parallel face plane is either empty or a collection of projection-disjoint convex polygons. A novel and efficient algorithm for construction of 3D orthogonal convex hull of a digital object is proposed. The algorithm is based on orthogonally slicing the object into slab polygons followed by connecting all possible slab polygons on a slicing plane and finding their 2D orthogonal convex hulls. The regions belonging to the 2D orthogonal convex hulls are replaced by the corresponding UGCs (unit grid cubes) and the exterior UGC-faces are merged to give the 3D orthogonal convex hull. The algorithm operates in integer domain and executes in time linear in the number of voxels on the object surface. The algorithm operates in exactly two passes irrespective of the object size or grid resolution. Experimentation with a wide range of objects has provided accurate results, some of which are presented here to demonstrate the effectiveness of the algorithm.


3D orthogonal convex hull Orthogonal slicing 3D orthogonal outer cover 3D concavity 2D orthogonal convex hull 



A part of this research is funded by CSIR, Govt. of India under SRF (File No. 08/03(0091)/2012-EMR-1) and Sponsored project (Scheme No. 22(0568)/12/EMR-II).


  1. 1.
    Barber, C.B., Dobkin, D.P., Huhdanpaa, H.: The quickhull algorithm for convex hulls. ACM Trans. Math. Softw. 22(4), 469–483 (1996)zbMATHMathSciNetCrossRefGoogle Scholar
  2. 2.
    Biswas, A., Bhowmick, P., Sarkar, M., Bhattacharya, B.B.: A linear-time combinatorial algorithm to find the orthogonal hull of an object on the digital plane. Inf. Sci. 216, 176–195 (2012)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Clarkson, K.L., Shor, P.W.: Applications of random sampling in computational geometry, II. Discrete Comput. Geom. 4(1), 387–421 (1989)zbMATHMathSciNetCrossRefGoogle Scholar
  4. 4.
    Dehne, F., Deng, X., Dymond, P., Fabri, A., Khokhar, A.A.: A randomized parallel 3D convex hull algorithm for coarse grained multicomputers. In: Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1995, pp. 27–33. ACM, New York (1995)Google Scholar
  5. 5.
    Eddy, W.F.: A new convex hull algorithm for planar sets. ACM Trans. Math. Softw. 3(4), 398–403 (1977)zbMATHCrossRefGoogle Scholar
  6. 6.
    Gao, M., Cao, T.T., Tan, T.S., Huang, Z.: gHull: A three-dimensional convex hull algorithm for graphics hardware. In: Symposium on Interactive 3D Graphics and Games, I3D 2011, pp. 204–204. ACM, New York (2011)Google Scholar
  7. 7.
    Graham, R.L.: An efficient algorithm for determining the convex hull of a finite planar set. Inf. Process. Lett. 1(4), 132–133 (1972)zbMATHCrossRefGoogle Scholar
  8. 8.
    Jarvis, R.: On the identification of the convex hull of a finite set of points in the plane. Inf. Process. Lett. 2(1), 18–21 (1973)zbMATHMathSciNetCrossRefGoogle Scholar
  9. 9.
    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
  10. 10.
    Karmakar, N., Biswas, A., Bhowmick, P., Bhattacharya, B.B.: Construction of 3D orthogonal cover of a digital object. In: Aggarwal, J.K., Barneva, R.P., Brimkov, V.E., Koroutchev, K.N., Korutcheva, E.R. (eds.) IWCIA 2011. LNCS, vol. 6636, pp. 70–83. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  11. 11.
    Karmakar, N., Biswas, A., Bhowmick, P., Bhattacharya, B.B.: A combinatorial algorithm to construct 3D isothetic covers. Int. J. Comput. Math. 90(8), 1571–1606 (2013)zbMATHCrossRefGoogle Scholar
  12. 12.
    Klette, R., Rosenfeld, A.: Digital Geometry: Geometric Methods for Digital Picture Analysis. Morgan Kaufmann, San Francisco (2004)Google Scholar
  13. 13.
    Preparata, F.P., Hong, S.J.: Convex hulls of finite sets of points in two and three dimensions. Commun. ACM 20(2), 87–93 (1977)zbMATHMathSciNetCrossRefGoogle Scholar
  14. 14.
    Preparata, F.P., Shamos, M.I.: Computational Geometry–An Introduction, 3rd edn. Springer, New York (1985)Google Scholar
  15. 15.
    Stein, A., Geva, E., El-Sana, J.: Applications of geometry processing: CudaHull: fast parallel 3D convex hull on the GPU. Comput. Graph. 36(4), 265–271 (2012)CrossRefGoogle Scholar
  16. 16.
    Sugihara, K.: Robust gift wrapping for the three-dimensional convex hull. J. Comput. Syst. Sci. 49(2), 391–407 (1994)zbMATHMathSciNetCrossRefGoogle Scholar
  17. 17.
    Wood, D.: An Isothetic View of Computational Geometry. University of Waterloo, Computer Science Department (1984)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Department of Information TechnologyIndian Institute of Engineering Science and TechnologyShibpurIndia

Personalised recommendations