Alpha Convex Hull, a Generalization of Convex Hull

Bounding hull, such as convex hull, concave hull, alpha shapes etc. has vast applications in different areas especially in computational geometry. Alpha shape and concave hull are generalizations of convex hull. Unlike the convex hull, they construct non-convex enclosure on a set of points. In this paper, we introduce another generalization of convex hull, named alpha-concave hull, and compare this concept with convex hull and alpha shape. We show that the alpha-concave hull is also a generalization of an NP-complete problem named min-area TSP. We prove that computing the alpha-concave hull is NP-hard on a set of points.

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

[2]  Se-Jong Oh,et al.  A New Concave Hull Algorithm and Concaveness Measure for n-dimensional Datasets , 2012, J. Inf. Sci. Eng..

[3]  Hong Yan,et al.  A discriminatory function for prediction of protein-DNA interactions based on alpha shape modeling , 2010, Bioinform..

[4]  Liu Jiyuan,et al.  Application of Convex Hull in Identifying the Types of Urban Land Expansion , 2003 .

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

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

[7]  Rien van de Weygaert,et al.  Alpha Shape Topology of the Cosmic Web , 2010, 2010 International Symposium on Voronoi Diagrams in Science and Engineering.

[8]  Sándor P. Fekete,et al.  On Simple Polygonalizations with Optimal Area , 2000, Discret. Comput. Geom..

[9]  Antony Galton,et al.  What Is the Region Occupied by a Set of Points? , 2006, GIScience.

[10]  David G. Kirkpatrick,et al.  On the shape of a set of points in the plane , 1983, IEEE Trans. Inf. Theory.

[11]  Zhengwei Yang,et al.  Image registration and object recognition using affine invariants and convex hulls , 1999, IEEE Trans. Image Process..

[12]  Richard K. Martin.  Using Alpha Shapes to Approximate Signal Strength Based Positioning Performance , 2011, IEEE Signal Processing Letters.

[13]  H. T. Mouftah,et al.  Localised alpha-shape computations for boundary recognition in sensor networks , 2009, Ad Hoc Networks.

[14]  Roddy MacLeod,et al.  Coarse Filters for Shape Matching , 2002, IEEE Computer Graphics and Applications.

[15]  Zhang Li.  CONVEX HULL BASED POINT PATTERN MATCHING UNDER PERSPECTIVE TRANSFORMATION , 2002 .

[16]  Donald R. Chand,et al.  An Algorithm for Convex Polytopes , 1970, JACM.

[17]  A. Ardeshir Goshtasby,et al.  Point pattern matching using convex hull edges , 1985, IEEE Transactions on Systems, Man, and Cybernetics.

[18]  S. Meeran,et al.  Optimum path planning using convex hull and local search heuristic algorithms , 1997 .

[19]  Joseph O'Rourke,et al.  Computational Geometry in C. , 1995 .

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

[21]  Godfried T. Toussaint,et al.  A historical note on convex hull finding algorithms , 1985, Pattern Recognit. Lett..

[22]  Sándor P. Fekete,et al.  Area optimization of simple polygons , 1993, SCG '93.

[23]  Antony Galton,et al.  Efficient generation of simple polygons for characterizing the shape of a set of points in the plane , 2008, Pattern Recognit..

[24]  Tiande Guo,et al.  An Efficient Algorithm for Fingerprint Matching Based on Convex Hulls , 2009, 2009 International Conference on Computational Intelligence and Natural Computing.

[25]  Nancy M. Amato,et al.  alpha-Decomposition of polygons , 2012, Comput. Graph..