An algorithm of searching and computing two adjacent polygons’ closest distance based on restricted circle has been proposed in this paper, which can be fitted for the situations of undistinguished shapes and location relationships of the two adjacent polygons.
本文还提出了基于约束圆寻找并计算任意两个实体多边形之间的最近距离方法,并给出了约束圆的特征。 这种方法适用于不用区分实体多边形的形状与位置的各种情况。
参考来源 - 空间关系中两相邻实体间最近距离算法研究·2,447,543篇论文数据,部分数据来源于NoteExpress
应用推荐