An Efficient Algorithm of Convex Hull for Very Large Planar Point Set

被引：0

作者：

Fan, Guangquan ^{[1
]}

Ma, Liping ^{[2
]}

Yang, Bingru ^{[3
]}

机构：

[1] Hebei Univ Econ & Business, Sch Management Sci & Engn, Shijiazhuang, Peoples R China

[2] Hebei Univ Econ & Business, Ctr Comp, Shijiazhuang, Hebei, Peoples R China

[3] Univ Sci & Technol Beijing, Sch Comp & Commun Engn, Beijing, Peoples R China

来源：

PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTER SCIENCE AND ENGINEERING (CSE 2013) | 2013年 / 42卷

关键词：

fast rampart searching algorithm; castle theorem; convex hull; computational geometry;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

In the paper, we present and prove Castle Theorem of Convex Hull, design and realize the Fast Rampart Searching Algorithm. The algorithm can be treated as the preprocess of Convex Hull calculation of very large planar point set. When calculating the Convex Hull of a very large planar point set, we can use the Fast Rampart Searching Algorithm to get a very small part points as candidate point set, and then we can get the Convex Hull of the whole planar point set from the candidate point set through other algorithms.

引用

页码：37 / 40

页数：4

共 50 条

[31] Convex hull and closure of a fuzzy set
Zhu, YG
JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2005, 16 (01) : 67 - 73
[32] A COUNTEREXAMPLE TO A CONVEX-HULL ALGORITHM FOR POLYGONS
TOUSSAINT, G
PATTERN RECOGNITION, 1991, 24 (02) : 183 - 184
[33] A Fast Convex Hull Algorithm for Binary Image
Zhang, Xianquan
Tang, Zhenjun
Yu, Jinhui
Guo, Mingming
INFORMATICA-JOURNAL OF COMPUTING AND INFORMATICS, 2010, 34 (03): : 369 - 376
[34] A Variational Convex Hull Algorithm
Li, Lingfeng
Luo, Shousheng
Tai, Xue-Cheng
Yang, Jiang
SCALE SPACE AND VARIATIONAL METHODS IN COMPUTER VISION, SSVM 2019, 2019, 11603 : 224 - 235
[35] An optimal real time algorithm for determine the convex hull of a set of points in a plane
Wang, ZQ
Xiao, LJ
COMPUTERS & INDUSTRIAL ENGINEERING, 1998, 35 (1-2) : 331 - 334
[36] An Efficient Algorithm for Finding the Minimum Perimeter Convex Hull of Disjoint Segments
Li, Nan
Jiang, Bo
Li, Nannan
PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND APPLICATION ENGINEERING (CSAE2018), 2018,
[37] Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set
Durocher, Stephane
Keil, J. Mark
Mehrabi, Saeed
Mondal, Debajyoti
COMPUTING AND COMBINATORICS (COCOON 2021), 2021, 13025 : 203 - 214
[38] Constructing the convex hull of a planar density-bounded integral points set in linear time
Deng, JH
Tang, ZS
Xu, MH
FOURTH INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN AND COMPUTER GRAPHICS, 1996, 2644 : 325 - 329
[39] A Convex Hull Algorithm for Plane Point Sets Based on Region Normalization Segmentation
Li K.
Gao Q.-W.
Lu Y.-X.
Sun D.
Zhu D.
Zidonghua Xuebao/Acta Automatica Sinica, 2022, 48 (12): : 2972 - 2980
[40] Adaptive Algorithms for Planar Convex Hull Problems
Ahn, Hee-Kap
Okamoto, Yoshio
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2011, E94D (02): : 182 - 189

← 1 2 3 4 5 →