The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
The point in polygon problem for arbitrary polygons
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Computer graphics: principles and practice
(2014) · Choice Reviews Online · doi:10.5860/choice.51-2713 · Cited by 4,651
The LEDA platform for combinatorial and geometric computing
Mehlhorn, K., Näher, S., & Uhrig, C. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-63165-8_161 · Cited by 1,199
O'Rourke, J., & Mallinckrodt, A. J. (1995) · Computers in Physics · doi:10.1063/1.4823371 · Cited by 1,199
O'Rourke, J. (1998) · Cambridge University Press eBooks · doi:10.1017/cbo9780511804120 · Cited by 848
(1999) · Choice Reviews Online · doi:10.5860/choice.36-6329 · Cited by 775
Shreiner, D. (2013) · Addison-Wesley eBooks · Cited by 655
Procedural Elements for Computer Graphics
Rogers, D. F. (1984) · Cited by 591
LEDA: A platform for combinatorial and geometric computing
(2000) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(00)90217-7 · Cited by 489
Ames, W. F. (1990) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(90)90088-z · Cited by 49
Cited by
Deep Matching Prior Network: Toward Tighter Multi-oriented Text Detection
Liu, Y., & Jin, L. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.368 · Cited by 351
UVIO: An UWB-aided visual-inertial odometry framework with bias-compensated anchors initialization
Delama, G., Shamsfakhr, F., Weiss, S., Fontanelli, D., & Fomasier, A. (2023) · 2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros55552.2023.10342012 · Cited by 19
Metadata
- Authors
- Hormann, K., & Agathos, A.
- Venue
- Computational Geometry
- Publisher
- Elsevier BV
- Published
- 2001-11
- Volume
- 20
- Issue
- 3
- Pages
- 131-144
- ISSN
- 0925-7721 (ISSN-L)
- OpenAlex
- W2100522523
- Cited by
- 397
- References
- 9
- FWCI
- 1.09
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The point in polygon problem for arbitrary polygons. https://app.cochat.ai/papers/10.1016/s0925-7721(01)00012-8
- The paper
- Hormann, K., & Agathos, A. (2001). The point in polygon problem for arbitrary polygons. Computational Geometry. https://doi.org/10.1016/s0925-7721(01)00012-8
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.