An optimal real time algorithm for determine the convex hull of a set of points in a plane

被引：0
|
作者：
Wang, ZQ [1 ]
Xiao, LJ [1 ]
机构：
[1] Shanghai Jiao Tong Univ, Dept Engn Mech, Shanghai 200240, Peoples R China
来源：
COMPUTERS & INDUSTRIAL ENGINEERING | 1998年 / 35卷 / 1-2期
关键词：
convex hull; set of points; star polygon; optimal algorithm; real time processing;
D O I：
10.1016/S0360-8352(98)00087-4
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
Based on the properties of star polygon and that the convex polygon is a special kind of star polygon, with the star point as the origin and the two lines respectively parallel to the x-axis and y-axis as coordinate axis, a relative coordinate system is built and the planar area is divided into four areas. Based on the new equation of relationship of point to orientation line, inner points and externals point of polygon are quickly separated, the embraced vertices (tangent vertices) of external points are rapidly found. An optimal real time algorithm for constructing the convex hull of a set of points in a plane is proposed. (C) 1998 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码：331 / 334
页数：4
相关论文
共 50 条
  • [21] A CONVEX HULL ALGORITHM FOR POINTS WITH APPROXIMATELY KNOWN POSITIONS
    Franciosa, Paolo Giulio
    Gaibisso, Carlo
    Gambosi, Giorgio
    Talamo, Maurizio
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1994, 4 (02) : 153 - 163
  • [22] CONVEX HULL OF A FINITE SET OF POINTS IN 2 DIMENSIONS - COMMENTS
    DEVAI, F
    SZENDRENYI, T
    [J]. INFORMATION PROCESSING LETTERS, 1979, 9 (03) : 141 - 142
  • [23] A new algorithm for constructing dynamic convex hull in the plane
    Wan, M
    Tang, ZS
    [J]. FOURTH INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN AND COMPUTER GRAPHICS, 1996, 2644 : 273 - 282
  • [24] A Fast Convex Hull Algorithm of Planar Point Set
    Jiang, Hong-fei
    [J]. MECHATRONICS AND INTELLIGENT MATERIALS III, PTS 1-3, 2013, 706-708 : 1852 - 1855
  • [25] Constructing the convex hull of a planar density-bounded integral points set in linear time
    Deng, JH
    Tang, ZS
    Xu, MH
    [J]. FOURTH INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN AND COMPUTER GRAPHICS, 1996, 2644 : 325 - 329
  • [26] Fast algorithm for convex hull of planer point set
    Zhou, Min
    Yang, Bo
    Liang, Yun
    Huang, Qiong
    Wan, Junzhou
    [J]. Journal of Information and Computational Science, 2013, 10 (04): : 1237 - 1243
  • [27] Round optimal parallel algorithms for the convex hull of sorted points
    Oshige, N.
    Fujiwara, A.
    [J]. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2001, E84-A (05) : 1152 - 1160
  • [28] Round optimal parallel algorithms for the convex hull of sorted points
    Oshige, N
    Fujiwara, A
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2001, E84A (05): : 1152 - 1160
  • [29] 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
    [J]. OPERATIONS RESEARCH LETTERS, 1994, 16 (01) : 33 - 40
  • [30] Neurocomputing model for computation of an approximate convex hull of a set of points and spheres
    Pal, Srimanta
    Bhattacharya, Sabyasachi
    [J]. IEEE TRANSACTIONS ON NEURAL NETWORKS, 2007, 18 (02): : 600 - 605
12345