[1] **viXra:1601.0127 [pdf]**
*submitted on 2016-01-12 09:19:21*

**Authors:** Kang Yang, Kevin yang, Shuang-ren Ren Zhao

**Comments:** 13 Pages. This is one of best method to create a polygon or to solve the problem "inside the polygon"

There are many method for nding whether a point is inside a polygon or not. The congregation
of all points inside a polygon can be referred point congregation of polygon. Assume on a plane
there are N points. Assume the polygon have M vertexes. There are O(NM) calculations to create
the point congregation of polygon. Assume N>>M, we oer a parallel calculation method which
is suitable for GPU programming. Our method consider a polygon is consist of many fan regions.
The fan region can be positive and negative.
We wold like to extended this method to 3 D problem where a polyhedron instead of polygon should be drawn using cones.

**Category:** Geometry