MINIMUM VERTEX DISTANCE BETWEEN SEPARABLE CONVEX POLYGONS

被引：11

作者：

CHIN, F

WANG, CA

机构：

来源：

关键词：

D O I：

10.1016/0020-0190(84)90073-5

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：41 / 45

页数：5

共 15 条

[1]

BENTLEY JL, 1979, IEEE T COMPUT, V28, P643, DOI 10.1109/TC.1979.1675432

[2]

CHIN F, UNPUB IEEE T COMPUT

[3]

CHIN F, 1982, OPTIMAL ALGORITHMS I

[4]

Dobkin D., 1980, ACM S THEOR COMP, P146

[5] FAST DETECTION OF POLYHEDRAL INTERSECTION [J].

DOBKIN, DP ;

KIRKPATRICK, DG .

[6] OPTIMAL ALGORITHM FOR FINDING THE KERNEL OF A POLYGON [J].

LEE, DT ;

PREPARATA, FP .

[7] GENERALIZATION OF VORONOI DIAGRAMS IN THE PLANE [J].

LEE, DT ;

DRYSDALE, RL .

[8]

MCKENNA M, 1983, FINDING MINIMUM VERT

[9]

MULLER DE, 1977, FINDING INTERSECTION

[10] FINDING THE MINIMUM DISTANCE BETWEEN 2 CONVEX POLYGONS [J].

SCHWARTZ, JT .