Nanetti, Luca

Renken, Remco J.

Sinha, Shriprakash

Ter Horst, Gert J.

English

The current work revisits the point-in-polygon problem by providing a novel solution that explicitly employs the properties of epigraphs and hypographs. Using concepts of epigraphs and hypographs, this manuscript provides a new definition of inaccessibility and inside, to accurately specify the meaning of inclusion of a point within or without a polygon. Via Poincaré's ideas on homotopy and Hopf's Degree Theorem from topology, a relationship between inaccessibility and inside is established and it is shown that consistent results are obtained for peculiar cases of both non-intersectingand self-intersecting polygons while investigating the point inclusion test w.r.t. a polygon. Through illustrative examples, the novel method addresses the issues of • ambiguous solutions given by the Cross Over for both non-intersecting and self-intersecting polygons and • a point being labeled as multi-ply inside a self-intersecting polygon by the Winding Number Rule, by providing an unambiguous and singular result for both kinds of polygons. The proposed solution bridgesthe gap between Cross Over and Winding Number Rule for complex cases.</p

Dissertations of the University of Groningen

Point in polygon problem via homotopy and Hopf's degree Theorem

https://pure.rug.nl/ws/files/565088238/Point_in_Polygon_Problem_via_Homotopy_and_Hopf_s_Degree_Theorem.pdf

Point in polygon problem via homotopy and Hopf's degree Theorem

Abstract

Similar works

Full text

Available Versions

Dissertations of the University of Groningen