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 条

[1] A Fast Convex Hull Algorithm of Planar Point Set
Jiang, Hong-fei
MECHATRONICS AND INTELLIGENT MATERIALS III, PTS 1-3, 2013, 706-708 : 1852 - 1855
[2] An Efficient Convex Hull Algorithm Using Affine Transformation in Planar Point Set
Xing, Changyuan
Xiong, Zhongyang
Zhang, Yufang
Wu, Xuegang
Dan, Jingpei
Zhang, Tingping
ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2014, 39 (11) : 7785 - 7793
[3] An Efficient Convex Hull Algorithm Using Affine Transformation in Planar Point Set
Changyuan Xing
Zhongyang Xiong
Yufang Zhang
Xuegang Wu
Jingpei Dan
Tingping Zhang
Arabian Journal for Science and Engineering, 2014, 39 : 7785 - 7793
[4] A new algorithm for computing the convex hull of a planar point set
Guang-hui Liu
Chuan-bo Chen
Journal of Zhejiang University-SCIENCE A, 2007, 8 : 1210 - 1217
[5] A new algorithm for computing the convex hull of a planar point set
Liu, Guang-Hui
Chen, Chuan-Bo
JOURNAL OF ZHEJIANG UNIVERSITY-SCIENCE A, 2007, 8 (08): : 1210 - 1217
[6] A new algorithm for computing the convex hull of a planar point set
LIU Guang-hui
Journal of Zhejiang University(Science A:An International Applied Physics & Engineering Journal), 2007, (08) : 1210 - 1217
[7] A Convex Hull Algorithm for Planar Point Set Based on Privacy Protecting
Wang Qiang
Zhang Yuan-ping
PROCEEDINGS OF THE FIRST INTERNATIONAL WORKSHOP ON EDUCATION TECHNOLOGY AND COMPUTER SCIENCE, VOL III, 2009, : 434 - 437
[8] A fast parallel algorithm for finding the convex hull of a sorted point set
Berkman, O
Schieber, B
Vishkin, U
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1996, 6 (02) : 231 - 241
[9] AN EFFICIENT ALGORITHM FOR FINDING THE MINIMUM NORM POINT IN THE CONVEX-HULL OF A FINITE POINT SET IN THE PLANE
MAKIMOTO, N
NAKAGAWA, I
TAMURA, A
OPERATIONS RESEARCH LETTERS, 1994, 16 (01) : 33 - 40
[10] A modification of Graham's algorithm for determining the convex hull of a finite planar set
Phan Thanh An
ANNALES MATHEMATICAE ET INFORMATICAE, 2007, 34 : 3 - 8

← 1 2 3 4 5 →