To analyze the different locations of the intersection of a ray and a polygon quickly
a scheme of calculating the number for the intersection point is established based on the structure query language(SQL)and the method of weighting each side of the polygon. Combined with the optimized query mechanism of database management system
the amount of the intersections can be calculated by running the SQL once
and the spatial relationship between the point and polygon is confirmed rapidly. It is verified that the method is simpler and more understandable than the competing methods
especially for the complicated multi-vertex polygons.
关键词
Keywords
references
Feito F R, Torres J C, Urena L A. Orientation simplicity and inclusion test for planar polygons[J].Computer & Graphics, 1995, 19(4):595-600.
Li Weishi, Li Jiangxiong, Ke Yinglin. Orientation and point inclusion test for planar polygon [J]. Journal of Computer-Aided Design Computer Graphics, 2000, 12(6):405-407.
Wu Jian, Jiang Hong, Wang Xiaochun. A method for the decision of a point whether in or not in self-intersected polygon[J]. Journal of System Simulation, 2003, 15(11):1592-1594.
Zhang Ningning, Zhang Shuyou, Tan Jianrong. Point inclusion test for simple polygons by the nearest relevant edge [J]. Journal of Computer-Aided Design Computer Graphics, 2004, 16(7): 935-938.
Wang Chen, Chi Jianbin, Feng Guizhen. A method of judging the relationship between point and polygon[J]. Computer Applications and Software, 2005, 22(4):110-112.