ONLINE CONSTRUCTION OF THE CONVEX-HULL OF A SIMPLE POLYLINE

被引:148
作者
MELKMAN, AA [1 ]
机构
[1] BEN GURION UNIV NEGEV,BEER SHEVA,ISRAEL
关键词
D O I
10.1016/0020-0190(87)90086-X
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:11 / 12
页数:2
相关论文
共 6 条
[1]   A NEW LINEAR CONVEX-HULL ALGORITHM FOR SIMPLE POLYGONS [J].
BHATTACHARYA, BK ;
ELGINDY, H .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1984, 30 (01) :85-88
[2]   FINDING THE CONVEX-HULL OF A SIMPLE POLYGON [J].
GRAHAM, RL ;
YAO, FF .
JOURNAL OF ALGORITHMS, 1983, 4 (04) :324-331
[3]   ON FINDING THE CONVEX-HULL OF A SIMPLE POLYGON [J].
LEE, DT .
INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1983, 12 (02) :87-98
[4]   LINEAR ALGORITHM FOR FINDING THE CONVEX-HULL OF A SIMPLE POLYGON [J].
MCCALLUM, D ;
AVIS, D .
INFORMATION PROCESSING LETTERS, 1979, 9 (05) :201-206
[5]   OPTIMAL REAL-TIME ALGORITHM FOR PLANAR CONVEX HULLS [J].
PREPARATA, FP .
COMMUNICATIONS OF THE ACM, 1979, 22 (07) :402-405
[6]   CONVEX DECOMPOSITION OF SIMPLE POLYGONS [J].
TOR, SB ;
MIDDLEDITCH, AE .
ACM TRANSACTIONS ON GRAPHICS, 1984, 3 (04) :244-265