COMPUTING THE EXTREME DISTANCES BETWEEN 2 CONVEX POLYGONS

被引:54
作者
EDELSBRUNNER, H [1 ]
机构
[1] GRAZ TECH UNIV,INST INFORMAT PROC,A-8010 GRAZ,AUSTRIA
关键词
D O I
10.1016/0196-6774(85)90039-2
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:213 / 224
页数:12
相关论文
共 9 条
[1]   EFFICIENT ALGORITHMS FOR COMPUTING THE MAXIMUM DISTANCE BETWEEN 2 FINITE PLANAR SETS [J].
BHATTACHARYA, BK ;
TOUSSAINT, GT .
JOURNAL OF ALGORITHMS, 1983, 4 (02) :121-136
[2]  
CHAZELLE B, 1980, 12TH P ANN ACM S THE, P146
[3]  
CHIN F, 1982, OPTIMAL ALGORITHMS I
[4]  
DOBKIN DP, 1982, 9TH P INT C AUT LANG, P154
[5]   LINEAR ALGORITHM FOR FINDING THE CONVEX-HULL OF A SIMPLE POLYGON [J].
MCCALLUM, D ;
AVIS, D .
INFORMATION PROCESSING LETTERS, 1979, 9 (05) :201-206
[6]  
MCKENNA M, 1983, SOCS836 MCGILL U SCH
[7]   FINDING THE MINIMUM DISTANCE BETWEEN 2 CONVEX POLYGONS [J].
SCHWARTZ, JT .
INFORMATION PROCESSING LETTERS, 1981, 13 (4-5) :168-170
[8]  
Shamos M.I., 1975, P 7 ANN ACM S THEOR, P224
[9]  
TOUSSAINT G, PATTERN RECOGNITION