The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Computing contour trees in all dimensions
Open accessOverview
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
Marching cubes: A high resolution 3D surface construction algorithm
Lorensen, W. E., & Cline, H. E. (1987) · Proceedings of the 14th annual conference on Computer graphics and interactive techniques · doi:10.1145/37401.37422 · Cited by 10,104
Marching cubes: A high resolution 3D surface construction algorithm
Lorensen, W. E., & Cline, H. E. (1987) · ACM SIGGRAPH Computer Graphics · doi:10.1145/37402.37422 · Cited by 8,647
Efficiency of a Good But Not Linear Set Union Algorithm
Tarjan, R. E. (1975) · Journal of the ACM · doi:10.1145/321879.321884 · Cited by 1,403
Introduction to Piecewise-Linear Topology
Rourke, C. P., & Sanderson, B. J. (1972) · Springer eBooks · doi:10.1007/978-3-642-81735-9 · Cited by 1,047
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
Edelsbrunner, H., & Mücke, E. P. (1990) · ACM Transactions on Graphics · doi:10.1145/77635.77639 · Cited by 711
Octrees for faster isosurface generation
Wilhelms, J., & Van Gelder, A. (1992) · ACM Transactions on Graphics · doi:10.1145/130881.130882 · Cited by 569
Surface coding based on Morse theory
Shinagawa, Y., Kunii, T. L., & Kergosien, Y. L. (1991) · IEEE Computer Graphics and Applications · doi:10.1109/38.90568 · Cited by 334
Critical points and curvature for embedded polyhedra
Banchoff, T. (1967) · Journal of Differential Geometry · doi:10.4310/jdg/1214428092 · Cited by 213
Cited by
Visualizing high-dimensional data: advances in the past decade
Liu, S., Maljovec, D., Wang, B., Bremer, P.-T., & Pascucci, V. (2017) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2016.2640960 · Cited by 427
Metadata
- Authors
- Carr, H., Snoeyink, J., & Axen, U.
- Venue
- Computational Geometry
- Publisher
- Elsevier BV
- Published
- 2003-02
- Volume
- 24
- Issue
- 2
- Pages
- 75-94
- ISSN
- 0925-7721 (ISSN-L)
- OpenAlex
- W3138447845
- Cited by
- 455
- References
- 8
- FWCI
- 22.01
- 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: Computing contour trees in all dimensions. https://app.cochat.ai/papers/10.1016/s0925-7721(02)00093-7
- The paper
- Carr, H., Snoeyink, J., & Axen, U. (2003). Computing contour trees in all dimensions. Computational Geometry. https://doi.org/10.1016/s0925-7721(02)00093-7
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.
