A method for the decision of a point whether in or not in polygon and self-intersected polygon.

FSKD(2011)

引用 6|浏览2
暂无评分
摘要
In this paper a new method is proposed to decide whether a point is in a simple polygon and a self-intersected polygon. A ray is rejected from the test point. According to the position between the edges of polygon and the ray, we define a position function of edges as to the ray, and then count the sum of the position function of all edges. We can decide whether the point is in the simple polygon and the self-intersected polygon by the sum. This method not only applies for simple polygon, but also for self-intersected polygon. Experiment result indicates that this method is simple, robust and fast. © 2011 IEEE.
更多
查看译文
关键词
polygon,computational geometry,computer graphics,robustness,simple polygon
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要