The point in polygon problem for arbitrary polygons
By Kai Hormann, A. Agathos. Computational geometry, 2001
395 citations recorded by the source corpus.
A detailed discussion of the point in polygon problem for arbitrary polygons is given. Two concepts for solving this problem are known in literature: the even–odd ruleand the winding number, the former leading to ray-crossing, the latter to angle summationalgorithms. First we show by mathematical means that both concepts are very closely related, thereby developing a first version of an algorithm for determining the winding number. Then we examine how to accelerate this algorithm and how to handle special cases. Furthermore we compare these algorithms with those found in literature and discuss the results. 2001 Elsevier Science B.V. All rights reserved.
Subfields: Computational Mechanics, Computer Graphics and Computer-Aided Design
View Paper: https://www.semanticscholar.org/paper/4ffe636eadc2dc6459089a0edd0a671302d7f676
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Mechanics
In Computer Graphics and Computer-Aided Design
Citations in the corpus
- Deep Matching Prior Network: Toward Tighter Multi-oriented Text Detection (2017, methodology): “thread to be responsible for calculating each sliding window with the specified ground truth, and thus we can handle thousands of sliding windows in a short time. Note that we use a method proposed in [12] to judge whether a point is inside a polygon, and this method is also known as the crossing num”