快速判断点是否在自交多边形内的方法  

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

作　　者：吴坚[1] 姜虹[1] 王小椿[1] 

机构地区：[1]西安交通大学机械工程学院数控研究所,西安710049

出　　处：《系统仿真学报》2003年第11期1592-1594,共3页Journal of System Simulation

摘　　要：提出一种新方法,检测一个点是否在多边形和环内。此方法从检测点发出一条射线,根据边与射线的位置关系,定义了边相对于射线的位置函数,然后计算出所有边的位置函数之和,据此判断检测点是否在多边形和环内。该方法不仅能够检测简单多边形,还可用于检测自交多边形,并能同时检测多个多边形。实验结果表明,该方法简单,可靠,检测速度快。In this paper a new method is proposed to decide whether a point is in a polygon, a self-intersected polygon and a ring. 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 polygon, the self-intersected polygon or the ring by the sum. This method applies not only for simple polygon, but also for self-intersected polygon and several simple polygons in the same time. Experiment result indicates that this method is simple, robust and fast.

关 键 词：多边形 简单多边形 自交多边形 包含检测 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]