求两凸多边形间的距离的快速算法  

A FAST ALGORITHM FOR EVALUATING THE DISTANCE BETWEEN TWO CONVEX POLYGONS

作　　者：陈亮[1] 宋恩民[1] 黄文奇[1] 

机构地区：[1]华中理工大学计算机科学与工程系,复旦大学计算机系

出　　处：《计算机学报》1994年第A00期116-121,共6页Chinese Journal of Computers

基　　金：国家自然科学基金

摘　　要：本文提出了一个求两互不相交的凸多边形间的距离的快速算法．两个凸多边形间的距离指的是这两个凸多边形沿着连心线方向以平移方式相互接近直至相交时所经过的路径长度．The distance between two convex POlygons refers to the length of the path that they have passed when they translate toward each other along the line linkingtheir geometry centers until they intersect. A fast algorithm to evaluate the distance between two disjointed convex POlygons is obtained.This is the fastest one among thosepublished so far.

关 键 词：凸多边形 距离 算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]