The DOI matches its Crossref record.
A SIMPLE ALGORITHM FOR HOMEOMORPHIC SURFACE RECONSTRUCTION
Abstract
The problem of computing a piecewise linear approximation to a surface from a set of sample points is important in solid modeling, computer graphics and computer vision. A recent algorithm 1 using the Voronoi diagram of the sample points gave a guarantee on the distance of the output surface from the original sampled surface assuming that the sample was sufficiently dense. We give a similar algorithm, simplifying the computation and the proof of the geometric guarantee. In addition, we guarantee that our output surface is homeomorphic to the original surface; to our knowledge this is the first such topological guarantee for this problem.
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
The power crust, unions of balls, and the medial axis transform
Amenta, N., Choi, S., & Kolluri, R. K. (2001) · Computational Geometry · doi:10.1016/s0925-7721(01)00017-7 · Cited by 526
Self-citationFinding the homology of submanifolds with high confidence from random samples
Niyogi, P., Smale, S., & Weinberger, S. (2008) · Discrete & Computational Geometry · doi:10.1007/s00454-008-9053-2 · Cited by 523
Estimating surface normals in noisy point cloud data
Mitra, N. J., & Nguyen, A. (2003) · Proceedings of the nineteenth annual symposium on Computational geometry · doi:10.1145/777792.777840 · Cited by 413
Topological estimation using witness complexes
Silva, V. D., & Carlsson, G. (2004) · The Eurographics Association · doi:10.2312/spbg/spbg04/157-166 · Cited by 337
Provably good sampling and meshing of surfaces
Boissonnat, J.-D., & Oudot, S. (2005) · Graphical Models · doi:10.1016/j.gmod.2005.01.004 · Cited by 324
Metadata
- Authors
- AMENTA, N., CHOI, S., DEY, T. K., & LEEKHA, N.
- Venue
- International Journal of Computational Geometry & Applications
- Publisher
- World Scientific Pub Co Pte Lt
- Published
- 2002-02
- Volume
- 12
- Issue
- 01n02
- Pages
- 125-141
- ISSN
- 0218-1959 (ISSN-L)
- 1793-6357
- OpenAlex
- W2106209520
- Cited by
- 229
- References
- 0
- FWCI
- 36.07
- 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: A SIMPLE ALGORITHM FOR HOMEOMORPHIC SURFACE RECONSTRUCTION. https://app.cochat.ai/papers/10.1142/s0218195902000773
- The paper
- AMENTA, N., CHOI, S., DEY, T. K., & LEEKHA, N. (2002). A SIMPLE ALGORITHM FOR HOMEOMORPHIC SURFACE RECONSTRUCTION. International Journal of Computational Geometry & Applications. https://doi.org/10.1142/s0218195902000773
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.