Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 397

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 access
Hormann, Kai, Agathos, Alexander·2001·Computational Geometry

Abstract

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/s0925-7721(01)00012-8

Cites

9 of 9 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 9 references

Cited by

See all 397

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.