English

Inaccessibility-Inside Theorem for Point in Polygon

Computational Geometry 2015-03-17 v2 Graphics

Abstract

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.

Keywords

Cite

@article{arxiv.1010.0552,
  title  = {Inaccessibility-Inside Theorem for Point in Polygon},
  author = {Shriprakash Sinha and Luca Nanetti},
  journal= {arXiv preprint arXiv:1010.0552},
  year   = {2015}
}

Comments

23 pages, 22 figures

R2 v1 2026-06-21T16:23:19.006Z