DocumentCode
3305670
Title
A method for the decision of a point whether in or not in polygon and self-intersected polygon
Author
Wu Jian ; Cai Zongyan
Author_Institution
Key Lab. for Highway Constr. Technol. & Equip. of Minist. of Educ., Chang´an Univ., Xi´an, China
Volume
1
fYear
2011
fDate
26-28 July 2011
Firstpage
16
Lastpage
18
Abstract
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.
Keywords
computational geometry; polygon edges; position function; self-intersected polygon; Computer graphics; Computers; Educational institutions; Laboratories; Presses; Robustness; inclusion test; polygon; self-intersected polygon; simple polygon;
fLanguage
English
Publisher
ieee
Conference_Titel
Fuzzy Systems and Knowledge Discovery (FSKD), 2011 Eighth International Conference on
Conference_Location
Shanghai
Print_ISBN
978-1-61284-180-9
Type
conf
DOI
10.1109/FSKD.2011.6019594
Filename
6019594
Link To Document