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 条

[31] OPTIMAL REAL-TIME ALGORITHM FOR PLANAR CONVEX HULLS
PREPARATA, FP
[J]. COMMUNICATIONS OF THE ACM, 1979, 22 (07) : 402 - 405
[32] THE CONVEX FEASIBLE SET ALGORITHM FOR REAL TIME OPTIMIZATION IN MOTION PLANNING
Liu, Changliu
Lin, Chung-Yen
Tomizuka, Masayoshi
[J]. SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 2018, 56 (04) : 2712 - 2733
[33] A new algorithm for computing the convex hull of a planar point set
Guang-hui Liu
Chuan-bo Chen
[J]. Journal of Zhejiang University-SCIENCE A, 2007, 8 : 1210 - 1217
[34] A new algorithm for computing the convex hull of a planar point set
Liu, Guang-Hui
Chen, Chuan-Bo
[J]. JOURNAL OF ZHEJIANG UNIVERSITY-SCIENCE A, 2007, 8 (08): : 1210 - 1217
[35] 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
[J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1996, 6 (02): : 123 - 130
[36] AN EFFICIENT ALGORITHM FOR THE CONVEX HULL OF PLANAR SCATTERED POINT SET
Fu, Zhongliang
Lu, Yuefeng
[J]. XXII ISPRS CONGRESS, TECHNICAL COMMISSION II, 2012, 39-B2 : 63 - 66
[37] A new algorithm for computing the convex hull of a planar point set
LIU Guang-hui
[J]. Journal of Zhejiang University-Science A(Applied Physics & Engineering), 2007, (08) : 1210 - 1217
[38] THE MAXIMUM SIZE OF A CONVEX POLYGON IN A RESTRICTED SET OF POINTS IN THE PLANE
ALON, N
KATCHALSKI, M
PULLEYBLANK, WR
[J]. DISCRETE & COMPUTATIONAL GEOMETRY, 1989, 4 (03) : 245 - 251
[39] AN O(LOG N) TIME PARALLEL ALGORITHM FOR TRIANGULATING A SET OF POINTS IN THE PLANE
WANG, CA
TSIN, YH
[J]. INFORMATION PROCESSING LETTERS, 1987, 25 (01) : 55 - 60
[40] FINDING THE CLOSEST POINT TO THE ORIGIN IN THE CONVEX-HULL OF A DISCRETE SET OF POINTS
SHERALI, HD
CHOI, GH
[J]. COMPUTERS & OPERATIONS RESEARCH, 1993, 20 (04) : 363 - 370

← 1 2 3 4 5 →