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 条

[11] On the Oβ-hull of a planar point set
Alegria-Galicia, Carlos
Orden, David
Seara, Carlos
Urrutia, Jorge
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2018, 68 : 277 - 291
[12] A connectionist model for convex-hull of a planar set
Datta, A
Pal, S
Pal, NR
NEURAL NETWORKS, 2000, 13 (03) : 377 - 384
[13] An output-sensitive convex hull algorithm for planar objects
Nielsen, F
Yvinec, M
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1998, 8 (01) : 39 - 65
[14] An algorithm for constructing the convex hull of a set of spheres in dimension d
Boissonnat, JD
Cerezo, A
Devillers, O
Duquesne, J
Yvinec, M
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1996, 6 (02): : 123 - 130
[15] Determining Curves in Convex Hull from a Set of Planar Closed Convex Curves
Vishwanath, A.V.
Ramanathan, M.
Vishwanath, A. V. (vishwanathavin@gmail.com), 1600, Bellwether Publishing, Ltd. (11) : 99 - 106
[16] Efficient convex hull computation for planar freeform curves
Kim, Yong-Joon
Lee, Jieun
Kim, Myung-Soo
Elber, Gershon
COMPUTERS & GRAPHICS-UK, 2011, 35 (03): : 698 - 705
[17] DISTRIBUTED ALGORITHM FOR THE PLANAR CONVEX-HULL PROBLEM
BEZ, HE
EDWARDS, J
COMPUTER-AIDED DESIGN, 1990, 22 (02) : 81 - 86
[18] Space-efficient planar convex hull algorithms
Brönnimann, H
Iacono, J
Katajainen, J
Morin, P
Morrison, J
Toussaint, G
THEORETICAL COMPUTER SCIENCE, 2004, 321 (01) : 25 - 40
[19] THE CONVEX-HULL OF A SET OF CONVEX POLYGONS
CHEN, H
ROKNE, J
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1992, 42 (3-4) : 163 - 172
[20] CONVEX_HULL - A Pascal program for determining the convex hull for planar sets
Yamamoto, JK
COMPUTERS & GEOSCIENCES, 1997, 23 (07) : 725 - 738

← 1 2 3 4 5 →