Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Inaccessibility-Inside Theorem for Point in Polygon (1010.0552v2)

Published 4 Oct 2010 in cs.CG and cs.GR

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.

Citations (1)

Summary

We haven't generated a summary for this paper yet.