一种改进的多边形数据内点自动生成算法

摘要

The polygon data interior point automatic generation algorithm based on Minimum Bounding Rectangle(MBR) easily leads to failure in the singular case. In order to solve the problem, this paper proposes an improved polygon data interior point automatic generation algorithm which introduces the vector data uncertainty interval concept. The improved algorithm uses the approach of uncertainty interval and intersection interval to fix the singular case, which avoids too much exception handling and branch structure of the MBR algorithm when the cutting line intersects with the node. Comparative experimental results prove the robustness and efficiency of the improved algorithm.%基于最小外切矩形(MBR)的多边形内点生成算法在奇异情况下容易失效.针对该问题,引入矢量数据的不确定性区间,提出一种改进的多边形数据内点自动生成算法.采用不确定性区间和相交区间的处理方法对奇异情况进行统一修正,避免MBR算法对于切割线与节点相交情况的过多异常处理和分支结构.通过对比实验验证了该算法的健壮性和高效性.