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

The DOI matches its Crossref record.

Set Membership Classification: A Unified Approach to Geometric Intersection Problems

Tilove·1980·IEEE Transactions on Computers

Abstract

Many practically important problems in computational geometry may be regarded as a generalization of "clipping," and may be formulated precisely in terms of a function called "membership classification." This function operates on a pair of point sets called the reference and candidate sets; it segments the candidate into three subsets which are "inside," "outside," and "on the boundary of" the reference. Examples of classification problems include clipping, polygon intersection, point inclusion, and solid interference.

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.1109/tc.1980.1675470

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.

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

Cited by

See all 294

Metadata

Authors
Tilove
Venue
IEEE Transactions on Computers
Published
1980-10
Volume
C-29
Issue
10
Pages
874-883
ISSN
  • 0018-9340 (ISSN-L)
  • 1557-9956
  • 2326-3814
OpenAlex
W2029322949
Cited by
294
References
0
FWCI
12.15
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: Set Membership Classification: A Unified Approach to Geometric Intersection Problems. https://app.cochat.ai/papers/10.1109/tc.1980.1675470
The paper
Tilove. (1980). Set Membership Classification: A Unified Approach to Geometric Intersection Problems. IEEE Transactions on Computers. https://doi.org/10.1109/tc.1980.1675470

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.