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 条
  • [41] Fast inline convex hull algorithm in any dimension
    Delpias, C
    6TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL XI, PROCEEDINGS: COMPUTER SCIENCE II, 2002, : 171 - 175
  • [42] A Faster Convex-Hull Algorithm via Bucketing
    Gamby, Ask Neve
    Katajainen, Jyrki
    ANALYSIS OF EXPERIMENTAL ALGORITHMS, SEA2 2019, 2019, 11544 : 473 - 489
  • [43] Convex hull of a fuzzy set and triangular norms
    Bielawski, Jakub
    Tabor, Jacek
    FUZZY SETS AND SYSTEMS, 2021, 417 : 93 - 109
  • [44] A CONVEX HULL ALGORITHM FOR POINTS WITH APPROXIMATELY KNOWN POSITIONS
    Franciosa, Paolo Giulio
    Gaibisso, Carlo
    Gambosi, Giorgio
    Talamo, Maurizio
    INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1994, 4 (02) : 153 - 163
  • [45] The convex hull of a Banach-Saks set
    Lopez-Abad, J.
    Ruiz, C.
    Tradacete, P.
    JOURNAL OF FUNCTIONAL ANALYSIS, 2014, 266 (04) : 2251 - 2280
  • [46] A SUBLOGARITHMIC CONVEX-HULL ALGORITHM
    FJALLSTROM, PO
    KATAJAINEN, J
    LEVCOPOULOS, C
    PETERSSON, O
    BIT, 1990, 30 (03): : 378 - 384
  • [47] Counting Non-Convex 5-Holes in a Planar Point Set
    Sung, Young-Hun
    Bae, Sang Won
    SYMMETRY-BASEL, 2022, 14 (01):
  • [48] ON THE MINIMUM CARDINALITY OF A PLANAR POINT SET CONTAINING TWO DISJOINT CONVEX POLYGONS
    Wu, Liping
    Lu, Wanbing
    STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA, 2013, 50 (03) : 331 - 354
  • [49] A novel connectionist framework for computation of an approximate convex-hull of a set of planar points, circles and ellipses
    Pal, S
    Bhattacharya, S
    Pal, NR
    INTERNATIONAL JOURNAL OF NEURAL SYSTEMS, 2006, 16 (01) : 15 - 28
  • [50] Two-center of the Convex Hull of a Point Set: Dynamic Model, and Restricted Streaming Model
    Sadhu, Sanjib
    Roy, Sasanka
    Nandi, Soumen
    Maheshwari, Anil
    Nandy, Subhas C.
    FUNDAMENTA INFORMATICAE, 2019, 164 (01) : 119 - 138