AN OPTIMAL ALGORITHM FOR COMPUTING THE MINIMUM VERTEX DISTANCE BETWEEN 2 CROSSING CONVEX POLYGONS

被引：12

|

作者：

TOUSSAINT, GT

机构：

来源：

COMPUTING | 1984年 / 32卷 / 04期

关键词：

D O I：

10.1007/BF02243778

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

下载

收藏

页码：357 / 364

页数：8

相关论文

共 50 条

[1] COMPUTING THE MINIMUM VISIBLE VERTEX DISTANCE BETWEEN 2 POLYGONS
AGGARWAL, A
MORAN, S
SHOR, PW
SURI, S
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 382 : 115 - 134
[2] MINIMUM VERTEX DISTANCE BETWEEN SEPARABLE CONVEX POLYGONS
CHIN, F
WANG, CA
INFORMATION PROCESSING LETTERS, 1984, 18 (01) : 41 - 45
[3] FINDING THE MINIMUM VERTEX DISTANCE BETWEEN 2 DISJOINT CONVEX POLYGONS IN LINEAR TIME
MCKENNA, M
TOUSSAINT, GT
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1985, 11 (12) : 1227 - 1242
[4] FINDING THE MINIMUM DISTANCE BETWEEN 2 CONVEX POLYGONS
SCHWARTZ, JT
INFORMATION PROCESSING LETTERS, 1981, 13 (4-5) : 168 - 170
[5] An Optimal Algorithm for Solving Collision Distance Between Convex Polygons in Plane
鄢勇
Journal of Computer Science & Technology, 1993, (04) : 367 - 373
[6] On computing the optimal bridge between two convex polygons
Bhattacharya, B
Benkoczi, R
INFORMATION PROCESSING LETTERS, 2001, 79 (05) : 215 - 221
[7] Computing the optimal bridge between two convex polygons
Chinese Univ of Hong Kong, Shatin, Hong Kong
Inf Process Lett, 3 (127-130):
[8] Computing the optimal bridge between two convex polygons
Cai, LZ
Xu, YF
Zhu, BH
INFORMATION PROCESSING LETTERS, 1999, 69 (03) : 127 - 130
[9] An algorithm on collision detection by computing the minimum distance between two convex polyhedra
Jin, Hanjun
Wang, Yanlin
Wang, Xiaorong
Fu, Jia
WCICA 2006: SIXTH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-12, CONFERENCE PROCEEDINGS, 2006, : 304 - 304
[10] A LINEAR TIME ALGORITHM FOR THE HAUSDORFF DISTANCE BETWEEN CONVEX POLYGONS
ATALLAH, MJ
INFORMATION PROCESSING LETTERS, 1983, 17 (04) : 207 - 209

← 1 2 3 4 5 →