The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Implicit fairing of irregular meshes using diffusion and curvature flow
Open accessAbstract
In this paper, we develop methods to rapidly remove rough features from irregularly triangulated data intended to portray a smooth surface.The main task is to remove undesirable noise and uneven edges while retaining desirable geometric features.The problem arises mainly when creating high-fidelity computer graphics objects using imperfectly-measured data from the real world.Our approach contains three novel features: an implicit integration method to achieve efficiency, stability, and large time-steps; a scale-dependent Laplacian operator to improve the diffusion process; and finally, a robust curvature flow operator that achieves a smoothing of the shape itself, distinct from any parameterization.Additional features of the algorithm include automatic exact volume preservation, and hard and soft constraints on the positions of the points in the mesh.We compare our method to previous operators and related algorithms, and prove that our curvature and Laplacian operators have several mathematically-desirable qualities that improve the appearance of the resulting surface.In consequence, the user can easily select the appropriate operator according to the desired type of fairing.Finally, we provide a series of examples to graphically and numerically demonstrate the quality of our results.
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
A volumetric method for building complex models from range images
Curless, B., & Levoy, M. (1996) · Proceedings of the 23rd annual conference on Computer graphics and interactive techniques · doi:10.1145/237170.237269 · Cited by 3,124
A signal processing approach to fair surface design
Taubin, G. (1995) · Proceedings of the 22nd annual conference on Computer graphics and interactive techniques - SIGGRAPH '95 · doi:10.1145/218380.218473 · Cited by 1,855
Large steps in cloth simulation
Baraff, D., & Witkin, A. (1998) · Proceedings of the 25th annual conference on Computer graphics and interactive techniques - SIGGRAPH '98 · doi:10.1145/280814.280821 · Cited by 1,684
Computing Discrete Minimal Surfaces and Their Conjugates
Pinkall, U., & Polthier, K. (1993) · Experimental Mathematics · doi:10.1080/10586458.1993.10504266 · Cited by 1,249
Generation of Finite Difference Formulas on Arbitrarily Spaced Grids
Bengt Fornberg, B. (1988) · Mathematics of Computation · doi:10.1090/s0025-5718-1988-0935077-0 · Cited by 1,014
Interactive multi-resolution modeling on arbitrary meshes
Kobbelt, L., Campagna, S., Vorsatz, J., & Seidel, H.-P. (1998) · Proceedings of the 25th annual conference on Computer graphics and interactive techniques - SIGGRAPH '98 · doi:10.1145/280814.280831 · Cited by 655
Multiresolution signal processing for meshes
Guskov, I., Sweldens, W., & Schröder, P. (1999) · Proceedings of the 26th annual conference on Computer graphics and interactive techniques - SIGGRAPH '99 · doi:10.1145/311535.311577 · Cited by 489
Self-citationThe computation of visible-surface representations
Terzopoulos, D. (1988) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.3908 · Cited by 450
Sethian, J. A. (1996) · Cambridge University Press eBooks · Cited by 338
Free-form shape design using triangulated surfaces
Welch, W., & Witkin, A. (1994) · Proceedings of the 21st annual conference on Computer graphics and interactive techniques - SIGGRAPH '94 · doi:10.1145/192161.192216 · Cited by 303
Cited by
Robust 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
Linear algebra operators for GPU implementation of numerical algorithms
Krüger, J., & Westermann, R. (2003) · ACM Transactions on Graphics · doi:10.1145/882262.882363 · Cited by 380
An intuitive framework for real-time freeform modeling
Botsch, M., & Kobbelt, L. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015772 · Cited by 254
Real-time data driven deformation with affine bones
Kim, B.-U., Feng, W.-W., & Yu, Y. (2010) · The Visual Computer · doi:10.1007/s00371-010-0474-6 · Cited by 6
Metadata
- Authors
- Desbrun, M., Meyer, M., Schröder, P., & Barr, A. H.
- Venue
- Proceedings of the 26th annual conference on Computer graphics and interactive techniques - SIGGRAPH '99
- Publisher
- ACM Press
- Published
- 1999
- Pages
- 317-324
- OpenAlex
- W2000214666
- Cited by
- 1,538
- References
- 11
- FWCI
- 77.52
- Type
- conference paper
- 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: Implicit fairing of irregular meshes using diffusion and curvature flow. https://app.cochat.ai/papers/10.1145/311535.311576
- The paper
- Desbrun, M., Meyer, M., Schröder, P., & Barr, A. H. (1999). Implicit fairing of irregular meshes using diffusion and curvature flow. Proceedings of the 26th annual conference on Computer graphics and interactive techniques - SIGGRAPH '99. https://doi.org/10.1145/311535.311576
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.
