The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Non-iterative, feature-preserving mesh smoothing
Open accessAbstract
With the increasing use of geometry scanners to create 3D models, there is a rising need for fast and robust mesh smoothing to remove inevitable noise in the measurements. While most previous work has favored diffusion-based iterative techniques for feature-preserving smoothing, we propose a radically different approach, based on robust statistics and local first-order predictors of the surface. The robustness of our local estimates allows us to derive a non-iterative feature-preserving filtering technique applicable to arbitrary "triangle soups". We demonstrate its simplicity of implementation and its efficiency, which make it an excellent solution for smoothing large, noisy, and non-manifold meshes.
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
Bilateral Filtering for Gray and Color Images
Tomasi, C., & Manduchi, R. (2002) · Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271) · doi:10.1109/iccv.1998.710815 · Cited by 8,177
SUSAN—a new approach to low level image processing
Smith, S. M., & Brady, J. M. (1997) · International Journal of Computer Vision · doi:10.1023/a:1007963824710 · Cited by 3,333
Cited by
Bilateral Filtering: Theory and Applications
Paris, S., Kornprobst, P., Tumblin, J., & Durand, F. (2009) · Foundations and Trends in Computer Graphics and Vision · doi:10.1561/0600000020 · Cited by 586
Self-citationRobust moving least-squares fitting with sharp features
Fleishman, S., Cohen-Or, D., & Silva, C. T. (2005) · ACM Transactions on Graphics · doi:10.1145/1073204.1073227 · Cited by 580
Nonlocal Discrete Regularization on Weighted Graphs: A Framework for Image and Manifold Processing
Elmoataz, A., Lezoray, O., & Bougleux, S. (2008) · IEEE Transactions on Image Processing · doi:10.1109/tip.2008.924284 · Cited by 466
Adaptive Bilateral Filter for Sharpness Enhancement and Noise Removal
Zhang, B., & Allebach, J. P. (2008) · IEEE Transactions on Image Processing · doi:10.1109/tip.2008.919949 · Cited by 403
James, D. L., & Twigg, C. D. (2005) · ACM Transactions on Graphics · doi:10.1145/1073204.1073206 · Cited by 361
Metadata
- Authors
- Jones, T. R., Durand, F., & Desbrun, M.
- Venue
- ACM SIGGRAPH 2003 Papers
- Publisher
- ACM
- Published
- 2003-07
- Pages
- 943-949
- OpenAlex
- W2159475546
- Cited by
- 421
- References
- 2
- FWCI
- 60.35
- Type
- conference paper
- Language
- en
- Open access
- green
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: Non-iterative, feature-preserving mesh smoothing. https://app.cochat.ai/papers/10.1145/1201775.882367
- The paper
- Jones, T. R., Durand, F., & Desbrun, M. (2003). Non-iterative, feature-preserving mesh smoothing. ACM SIGGRAPH 2003 Papers. https://doi.org/10.1145/1201775.882367
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.
