Inaccessibility-Inside Theorem for Point in Polygon

Details Inaccessibility-Inside Theorem for Point in Polygon Inaccessibility-Inside Theorem for Point in Polygon

2010-10-04

arxiv.org/abs/1010.0552v2

Computer Science

Computational Geometry

23 pages, 22 figures

Scientific paper

The manuscript presents a theoretical proof in conglomeration with new definitions on Inaccessibility and Inside for a point S related to a simple or self intersecting polygon P. The proposed analytical solution depicts a novel way of solving the point in polygon problem by employing the properties of epigraphs and hypographs, explicitly. Contrary to the ambiguous solutions given by the cross over for the simple and self intersecting polygons and the solution of a point being multiply inside a self intersecting polygon given by the winding number rule, the current solution gives unambiguous and singular result for both kinds of polygons. Finally, the current theoretical solution proves to be mathematically correct for simple and self intersecting polygons.

Affiliated with

Also associated with

No associations

Rating

Inaccessibility-Inside Theorem for Point in Polygon does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Inaccessibility-Inside Theorem for Point in Polygon, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Inaccessibility-Inside Theorem for Point in Polygon will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-274524