A Concave Hull Based Algorithm for Object Shape Reconstruction

Hull algorithms are the most efficient and closest methods to be redesigned for connecting vertices for geometric shape reconstruction. The vertices are the input points representing the original object shape. Our objective is to reconstruct the shape and edges but with no information on any pattern, it is challenging to reconstruct the lines to resemble the original shape. By comparing our results to recent concave hull based algorithms, two performance measures were conducted to evaluate the accuracy and time complexity of the proposed method. Besides achieving the most acceptable accuracy which is 100%, the time complexity of the proposed algorithm is evaluated to be ( ). All results have shown a competitive and more effective algorithm compared to the most efficient similar ones. The algorithm is shown to be able to solve the problems of vertices connection in an efficient way by devising a new approach.

[1]  Sumarie Meintjes.  Multi-objective optimisation of a commercial vehicle complex network , 2013 .

[2]  Oliver Nelles,et al.  Interpolation and extrapolation: Comparison of definitions and survey of algorithms for convex and concave hulls , 2014, 2014 IEEE Symposium on Computational Intelligence and Data Mining (CIDM).

[3]  Amal Dev Parakkat,et al.  A unified approach towards reconstruction of a planar point set , 2015, Comput. Graph..

[4]  Timothy M. Chan.  Optimal output-sensitive convex hull algorithms in two and three dimensions , 1996, Discret. Comput. Geom..

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

[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]  Se-Jong Oh,et al.  A New Concave Hull Algorithm and Concaveness Measure for n-dimensional Datasets , 2012, J. Inf. Sci. Eng..

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

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

[10]  Mahmoud Melkemi,et al.  Computing the shape of a planar points set , 2000, Pattern Recognit..

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

[12]  Maribel Yasmina Santos,et al.  Concave hull: A k-nearest neighbours approach for the computation of the region occupied by a set of points , 2007, GRAPP.