多边形内点自动生成算法的设计与实现

多边形内点可以用来关联多边形属性信息,也可以代表多边形构建多边形组群邻近关系。已有的多边形内点选取算法中,重点在于保证内点在多边形的内部,但是不能保证内点在多边形的中心区域,尤其是含岛屿多边形的情况,这时就不能有效地代表多边形建立正确的邻近关系。基于重心点算法、面积平分原则和移位处理,设计并实现了多边形内点自动生成算法。经实验验证,此算法能够保证多边形内点在多边形的中心区域。

DESIGN AND IMPLEMENTATION OF AN ALGORITHM TO AUTOMATICALLY CREATEONE POLYGON INTERIOR POINT

Polygon interior point can be used to associate the polygon attribute information and may also represent polygon to build the neighboring relationship of polygons. Almost of the existing algorithms ensure that the interior point is inside the polygon, but can not guarantee that the interior point is in the central region of polygon, especially the polygon with inside islets. Therefore it can not effec- tively represent polygon to build the accurate neighboring relationship. One synthesized algorithm,which is based on the centroid algo- rithm, area - bisected principle and shift approach,is designed and implemented to automatically create one polygon interior point . It is proven in experiments that the algorithm ensures the interior point in the central region of polygon.