A Convex Hull Algorithm for Plane Point Sets Based on Region Normalization Segmentation

被引：0

作者：

Li K. ^{[1
,2
]}

Gao Q.-W. ^{[1
,2
]}

Lu Y.-X. ^{[1
,2
]}

Sun D. ^{[1
,2
]}

Zhu D. ^{[1
,2
]}

机构：

[1] School of Electrical Engineering and Automation, Anhui University, Hefei

[2] Key Laboratory of Computational Intelligence and Signal Processing of Ministry of Education, Anhui University, Hefei

来源：

Zidonghua Xuebao/Acta Automatica Sinica | 2022年 / 48卷 / 12期

基金：

中国国家自然科学基金;

关键词：

convex hull; orthogonal segmentation; parallel algorithm; Planar point set;

D O I：

10.16383/j.aas.c190590

中图分类号：

学科分类号：

摘要：

In order to solve the convex hull calculation problem of ultra-large scale planar point set in practical engineering applications, a new algorithm based on orthogonal segmentation of the region where the point set is located is designed. The partial point of the point set geometry is used to orthogonalize the plane point set to obtain the incoherent point set subset cluster, and then the convex hull poles are calculated for all the point set subsets, and finally the convex hull point set is obtained by combining the poles. In the process of orthogonalization and segmentation in different levels, according to the information of the existing convex hull poles, many of invalid points are discarded layer by layer, which improves the efficiency of the algorithm. In the comparison experiment with the commonly used convex hull algorithm, the proposed algorithm has high stability and speed when dealing with super large-scale planar point sets. © 2022 Science Press. All rights reserved.

引用

页码：2972 / 2980

页数：8

共 21 条

[1] Barber C B, Dobkin D P, Huhdanpaa H., The quickhull algorithm for convex hulls, ACM Transactions on Mathematical Software, 22, 4, (1996)
[2] Kim Y, Kim J., Convex hull ensemble machine for regression and classification, Knowledge and Information Systems, 6, 6, pp. 645-663, (2004)
[3] Ding S G, Nie X L, Qiao H, Zhang B., A fast algorithm of convex hull vertices selection for online classification, IEEE Transactions on Neural Networks and Learning Systems, 29, 4, (2018)
[4] Long P M, Servedio R A., Random classification noise defeats all convex potential boosters, Machine Learning, 78, 3, pp. 287-304, (2010)
[5] Chau A L, Li X O, Yu W., Convex and concave hulls for classification with support vector machine, Neurocomputing, 122, pp. 198-209, (2013)
[6] Sadahiro Y., Number of polygons generated by map overlay: The case of convex polygons, Transactions in Gis, 5, 4, pp. 345-353, (2001)
[7] Chazelle B., An optimal convex hull algorithm in any fixed dimension, Discrete & Computational Geometry, 10, 4, pp. 377-409, (1993)
[8] Yao A C., A lower bound to finding convex hulls, Journal of the ACM, 28, 4, (1981)
[9] Akl S G, Toussaint G T., A fast convex hull algorithm, Information Processing Letters, 7, 5, (1978)
[10] Kim Y J, Lee J, Kim M S, Elber G., Efficient convex hull computation for planar freeform curves, Computers & Graphics, 35, 3, pp. 698-705, (2011)

← 1 2 3 →