A linear-time algorithm to compute the triangular hull of a digital object

Abstract A linear-time algorithm for determining the triangular hull of a digital object that is digitized with a uniform triangular-grid scan, is presented in this paper. A triangular hull consists of a sequence of edges on the underlying triangular grid T consisting of three sets of parallel grid lines that are inclined at 0 ° , 60 ° , and 120 ° w.r.t. the x -axis. The proposed algorithm determines the triangular hull of a given object on the basis of certain geometrical properties of the edge-sequence observed along its boundary. The approach is purely combinatorial in nature as opposed to other conventional algorithms used for computing the convex hull such as those based on divide-and-conquer or line-sweep. The running time of the algorithm is linear on the number of pixels on the perimeter of the object. Also, by using a more sparse grid, i.e., by increasing the grid unit, the number of perimeter-pixels, and in turn, the running time of the algorithm can be reduced proportionately. The algorithm is tested extensively on several test cases and experimental results and analysis are presented.

[1]  Asdrúbal López Chau,et al.  Convex-Concave Hull for Classification with Support Vector Machine , 2012, 2012 IEEE 12th International Conference on Data Mining Workshops.

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

[3]  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..

[4]  Henrik Schulz.  Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets , 2009, Discret. Appl. Math..

[5]  Partha Bhowmick,et al.  A Combinatorial Technique for Construction of Triangular Covers of Digital Objects , 2014, IWCIA.

[6]  GARRET SWART,et al.  Finding the Convex Hull Facet by Facet , 1985, J. Algorithms.

[7]  A. Kai Qin,et al.  Finding convex hull vertices in metric space , 2014, 2014 International Joint Conference on Neural Networks (IJCNN).

[8]  David G. Kirkpatrick,et al.  The Ultimate Planar Convex Hull Algorithm? , 1986, SIAM J. Comput..

[9]  David Avis,et al.  How good are convex hull algorithms? , 1995, SCG '95.

[10]  Bernard Chazelle,et al.  An optimal convex hull algorithm in any fixed dimension , 1993, Discret. Comput. Geom..

[11]  Gisela Klette.  A recursive algorithm for calculating the relative convex hull , 2010, 2010 25th International Conference of Image and Vision Computing New Zealand.

[12]  Raimund Seidel,et al.  Convex hulls of spheres and convex hulls of disjoint convex polytopes , 2013, Comput. Geom..

[13]  Partha Bhowmick,et al.  Finding the Orthogonal Hull of a Digital Object: A Combinatorial Approach , 2008, IWCIA.

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

[15]  Enkelejd Hashorva.  Asymptotics of the convex hull of spherically symmetric samples , 2011, Discret. Appl. Math..

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

[17]  Bo Shen Woun,et al.  A Hybrid Convex Hull Algorithm for Fingertips Detection , 2014, 2014 11th International Conference on Computer Graphics, Imaging and Visualization.