Abstract
Advances in sensors and cameras allow current research in convex hull algorithms to focus on defining methods capable of processing a big set of points. Typically, in most of these algorithms, the orientation function needs around five sums and two multiplications. In this paper, we propose SymmetricHull, a novel algorithm that, unlike the related ones, only performs two comparisons per point, discarding points with a low probability of belonging to the convex hull. Our algorithm takes advantage of the symmetric geometry of convex hulls in 2D spaces and relies on the convexity principle to get convex hulls, without needing further calculations. Our experiments show that SymmetricHull achieves good results, in terms of time and number of necessary operations, resulting especially efficient with sets of points between \(10^4\) and \(10^7\). Given that our datasets are organized by quadrants, the features of our algorithm can be summarized as follows: (1) a fast point discard based on known points with a good chance to be part of the convex hull, (2) a lexicographic sort of points with a high probability of belonging to the convex hull, and (3) a simple slope analysis to verify whether a point is within the convex hull or not.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Andrew, A.: Another efficient algorithm for convex hulls in two dimensions. Inf. Process. Lett. 9(5), 216–219 (1979)
Barber, C.B., Dobkin, D.P., Huhdanpaa, H.: The quickhull algorithm for convex hulls. ACM Trans. Math. Softw. 22(4), 469–483 (1996)
Chan, T.: Optimal output-sensitive convex hull algorithms in two and three dimensions. Discrete Computat. Geom. 16(4), 361–368 (1996)
Chand, D.R., Kapur, S.S.: An algorithm for convex polytopes. J. ACM (JACM) 17(1), 78–86 (1970)
de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-77974-2
Graham, R.L.: An efficient algorithm for determining the convex hull of a finite planar set. Inf. Process. Lett. 1(4), 132–133 (1972)
Kirkpatrick, D.G., Seidel, R.: The ultimate planar convex hull algorithm. SIAM J. Comput. Cornell Univ. 15(1), 287–299 (1986)
Liu, G.H., Chen, C.B.: A new algorithm for computing the convex hull of a planar point set. J. Zhejiang Univ. Sci. A 8(8), 1210–1217 (2007)
Liu, R., Fang, B., Tang, Y.Y., Wen, J., Qian, J.: A fast convex hull algorithm with maximum inscribed circle affine transformation. Neurocomput. 77(1), 212–221 (2012)
Sharif, M.: A new approach to compute convex hull. Innov. Syst. Des. Eng. 2(3), 186–192 (2011)
Changyuan, X., Zhongyang, X., Yufang, Z., Xuegang, W., Jingpei, D., Tingping, Z.: An efficient convex hull algorithm using affine transformation in planar point set. Arab. J. Sci. Eng. 39(11), 7785–7793 (2014)
Zavala, J.P., Anaya, E.K., Isaza, C., Castillo, E.: 3D measuring surface topography of agglomerated particles using a laser sensor. IEEE Lat. Am. Trans. 14(8), 3516–3521 (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Beltrán-Herrera, A., Mendoza, S. (2018). Fast Convex Hull by a Geometric Approach. In: Martínez-Trinidad, J., Carrasco-Ochoa, J., Olvera-López, J., Sarkar, S. (eds) Pattern Recognition. MCPR 2018. Lecture Notes in Computer Science(), vol 10880. Springer, Cham. https://doi.org/10.1007/978-3-319-92198-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-92198-3_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-92197-6
Online ISBN: 978-3-319-92198-3
eBook Packages: Computer ScienceComputer Science (R0)