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

The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.

COMPUTATIONAL GEOMETRY COLUMN 35

O'ROURKE, JOSEPH · 1999 · International Journal of Computational Geometry & Applications

Abstract

The subquadratic algorithm of Kapoor for finding shortest paths on a polyhedron is described.

Overview

Integrity signals

Registry

Crossref · 10.1142/s0218195999000297

Cites

6 of 6 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Show all 6 references

Cited by

See all 9

Metadata

Authors
O'ROURKE, J.
Affiliations
Department of Computer Science, Smith College, Northampton, MA 01063, USA
Venue
International Journal of Computational Geometry & Applications
Published
1999-08
Volume
09
Issue
04n05
Pages
513-515
ISSN
  • 0218-1959 (ISSN-L)
  • 1793-6357
OpenAlex
W2085958217
Cited by
9
References
6
Citations by year
2018: 1 · 2016: 3
FWCI
0.00
Type
journal article
Language
en
Open access
closed
Locations
  • International Journal of Computational Geometry & Applications (publishedVersion)
  • Smith ScholarWorks (Smith College) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computational Geometry and Mesh Generation
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
  • Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Advanced Combinatorial Mathematics
Keywords
subquadratic algorithms, computational geometry algorithms, polyhedral surfaces

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: COMPUTATIONAL GEOMETRY COLUMN 35. https://app.cochat.ai/papers/10.1142/s0218195999000297
The paper
O'ROURKE, J. (1999). COMPUTATIONAL GEOMETRY COLUMN 35. International Journal of Computational Geometry & Applications. https://doi.org/10.1142/s0218195999000297

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.