Closest distance computation algorithms and chains calculating algorithms have been designed according to different location relationships.
针对多边形之间不同位置关系，给出不同的最近距离和多边形之间彼此面对线段链的计算算法。
A closest distance computation method for simple polygons has been presented in this paper, which can be used to get the line segments (one chain from each polygon) of polygons at the same time.
提出简单多边形距离计算方法，在计算简单多边形最近距离的同时，可以求得多边形之间彼此面对的线段链。
A closest distance computation method for simple polygons has been presented in this paper, which can be used to get the line segments (one chain from each polygon) of polygons at the same time.
提出简单多边形距离计算方法，在计算简单多边形最近距离的同时，可以求得多边形之间彼此面对的线段链。
应用推荐