摘要
为了解决射线法不能有效地判断点在复杂多边形内或外的问题,根据射线与多边形边界相交的特性,分析射线所经过的多边形的不同类型顶点,提出了对顶点数加1、加2和加3的运算方法。通过判断交点个数的奇偶性,改进了射线法,并给出了计算模型和算法的详细步骤,简单有效的将现有的射线法扩展到更复杂的多边形中,能准确的判断点与多边形的位置关系。4种不同算法对比分析结果表明,该算法能解决其它3种算法存在的问题,并且在简单多边形和复杂多边形中都是有效的。
To resolve the problem of ray-algorithm can＇t determine whether a point is inside a polygon effectively, according to the characteristic of Ray intersect with bound of polygon, and the type of vertex is analyzed, which is the ray have traversed. The method of adding one, adding two and adding three operations is proposed by determining the parity of the number of inter- sections, and the ray-algorithm is improved. The computational model and the detailed steps of the algorithm execution at the same time, and it is extended are given into the more complexity of polygon simply and effectively. A topological relation between point and polygon is analyzed accurately. It shows that the result of four different algorithms compared, the algorithm can solve the problem of other algorithms, and it is effective to simple and complicated of polygons.
出处
《计算机工程与设计》
CSCD
北大核心
2014年第5期1732-1737,共6页
Computer Engineering and Design
基金
2011广西教育厅科研基金项目(201106LX868
201106LX864)
广西电大中青年基金项目(2012ZQN06)
关键词
多边形
点
点与多边形位置
射线法
拓扑关系
polygon
point
position of point and polygon
pay
topological relationship
