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.
Comments: 13 Pages. This is one of best method to create a polygon or to solve the problem "inside the polygon"
[v1] 2016-01-12 09:19:21
Unique-IP document downloads: 101 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.