The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
A formal definition of binary topological relationships
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
Talmy, L. (1983) · Spatial Orientation · doi:10.1007/978-1-4615-9325-6_11 · Cited by 1,590
Giblin, P. (2010) · Cambridge University Press eBooks · doi:10.1017/cbo9780511779534 · Cited by 246
A topological data model for spatial databases
Egenhofer, M. J., Frank, A. U., & Jackson, J. P. (1990) · Lecture notes in computer science · doi:10.1007/3-540-52208-5_32 · Cited by 153
Self-citation
Cited by
Point-set topological spatial relations
EGENHOFER, M. J., & FRANZOSA, R. D. (1991) · International journal of geographical information systems · doi:10.1080/02693799108927841 · Cited by 1,658
Self-citationThe Sequence Ontology: a tool for the unification of genome annotations
Eilbeck, K., Lewis, S. E., Mungall, C. J., Yandell, M., Stein, L., Durbin, R., & Ashburner, M. (2005) · Genome Biology · doi:10.1186/gb-2005-6-5-r44 · Cited by 806
An introduction to spatial database systems
G�ting, R. H. (1994) · The VLDB Journal · doi:10.1007/bf01231602 · Cited by 724
Qualitative Spatial Representation and Reasoning: An Overview
Cohn, A. G., & Hazarika, S. M. (2001) · doi:10.5555/1219982.1219984 · Cited by 667
Reasoning about binary topological relations
Egenhofer, M. J. (1991) · Lecture Notes in Computer Science · doi:10.1007/3-540-54414-3_36 · Cited by 628
Self-citation
Metadata
- Authors
- Egenhofer, M. J.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1989
- Pages
- 457-472
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1849252796
- Cited by
- 345
- References
- 3
- FWCI
- 6.41
- Type
- conference paper
- 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: A formal definition of binary topological relationships. https://app.cochat.ai/papers/10.1007/3-540-51295-0_148
- The paper
- Egenhofer, M. J. (1989). A formal definition of binary topological relationships. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-51295-0_148
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.