The DOI matches its Crossref record.
Algorithms for Reporting and Counting Geometric Intersections
Abstract
An interesting class of "geometric intersection problems" calls for dealing with the pairwise intersections among a set of N objects in the plane, These problems arise in many applications such as printed circuit design, architectural data bases, and computer graphics. Shamos and Hoey have described a number of algorithms for detecting whether any two objects in a planar set intersect. In this paper we extend their work by giving algorithms that count the number of such intersections and algorithms that report all such intersections.
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
Cited by
Spatial Planning: A Configuration Space Approach
Lozano-Perez (1983) · IEEE Transactions on Computers · doi:10.1109/tc.1983.1676196 · Cited by 2,113
REBOUND: an open-source multi-purpose N-body code for collisional dynamics
Rein, H., & Liu, S.-F. (2012) · Astronomy & Astrophysics · doi:10.1051/0004-6361/201118085 · Cited by 1,180
Geometric Type-1 and Type-2 Fuzzy Logic Systems
Coupland, S., & John, R. (2007) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2006.889764 · Cited by 316
Metadata
- Authors
- Bentley, & Ottmann
- Venue
- IEEE Transactions on Computers
- Published
- 1979-09
- Volume
- C-28
- Issue
- 9
- Pages
- 643-647
- ISSN
- 0018-9340 (ISSN-L)
- 1557-9956
- 2326-3814
- OpenAlex
- W1874694348
- Cited by
- 996
- References
- 0
- FWCI
- 17.45
- Type
- journal article
- Language
- en
- Open access
- closed
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: Algorithms for Reporting and Counting Geometric Intersections. https://app.cochat.ai/papers/10.1109/tc.1979.1675432
- The paper
- Bentley, & Ottmann. (1979). Algorithms for Reporting and Counting Geometric Intersections. IEEE Transactions on Computers. https://doi.org/10.1109/tc.1979.1675432
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.
