Construction of 3D Orthogonal Convex Hull of a Digital Object

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.

[1]  Ray A. Jarvis,et al.  On the Identification of the Convex Hull of a Finite Set of Points in the Plane , 1973, Inf. Process. Lett..

[2]  Partha Bhowmick,et al.  Construction of 3D Orthogonal Cover of a Digital Object , 2011, IWCIA.

[3]  Partha Bhowmick,et al.  Fast Slicing of Orthogonal Covers Using DCEL , 2012, IWCIA.

[4]  Xiaotie Deng,et al.  A randomized parallel 3D convex hull algorithm for coarse grained multicomputers , 1995, SPAA '95.

[5]  Jihad El-Sana,et al.  CudaHull: Fast parallel 3D convex hull on the GPU , 2012, Comput. Graph..

[6]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[7]  Ronald L. Graham,et al.  An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..

[8]  Kenneth L. Clarkson,et al.  Applications of random sampling in computational geometry, II , 1988, SCG '88.

[9]  Azriel Rosenfeld,et al.  Digital geometry - geometric methods for digital picture analysis , 2004 .

[10]  Derick Wood,et al.  An Isothetic View of Computational Geometry† †Work carried out under a Natural Sciences and Engineering Research Council of Canada Grant No. A-5692. , 1985 .

[11]  Partha Bhowmick,et al.  A linear-time combinatorial algorithm to find the orthogonal hull of an object on the digital plane , 2012, Inf. Sci..

[12]  Partha Bhowmick,et al.  A combinatorial algorithm to construct 3D isothetic covers , 2013, Int. J. Comput. Math..

[13]  William F. Eddy,et al.  A New Convex Hull Algorithm for Planar Sets , 1977, TOMS.

[14]  Tiow Seng Tan,et al.  gHull: a three-dimensional convex hull algorithm for graphics hardware , 2011, I3D '11.

[15]  F. P. Preparata,et al.  Convex hulls of finite sets of points in two and three dimensions , 1977, CACM.

[16]  David P. Dobkin,et al.  The quickhull algorithm for convex hulls , 1996, TOMS.

[17]  Kokichi Sugihara,et al.  Robust Gift Wrapping for the Three-Dimensional Convex Hull , 1994, J. Comput. Syst. Sci..