The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Functional optimization for fair surface design
Open accessAbstract
This paper presents a simple-to-use mechanism for the creation of complex smoothly shaped surfaces of any genus or topological type.The surfaces are specified through interpolated geometric constraints consisting of positions and, optionally, surface normals and surface curvatures.From a designer's point of view, this is a very natural way to specify a desired shape, whether free-form or technical.Nonlinear optimization techniques are then used to minimize a fairness functional based on the variation of curvature.This functional produces very high quality surfaces with predictable, intuitive behavior, while generating, where possible, simple shapes, such as cylinders, spheres, or tori, which are commonly used in geometric modeling.While easy to use, this optimization-based approach is computationally quite demanding.With more efficient optimization algorithms and with the ever increasing processing power available on every desk-top, the techniques described here will provide the basis for a new class of practical interactive geometric modeling tools.
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
Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables
Owen, D. B., Abramowitz, M., & Stegun, I. A. (1965) · Technometrics · doi:10.2307/1266136 · Cited by 16,138
Zienkiewicz, O. C. (1989) · Cited by 14,802
Methods of Mathematical Physics
Courant, R., & Hilbert, D. (1989) · Wiley eBooks · doi:10.1002/9783527617210 · Cited by 8,067
Differential geometry of curves and surfaces
(2011) · Choice Reviews Online · doi:10.5860/choice.48-3330 · Cited by 3,706
Elementary Numerical Analysis: An Algorithmic Approach
W., J. W., & Conte, S. D. (1967) · Mathematics of Computation · doi:10.2307/2003277 · Cited by 1,327
Elementary Numerical Analysis.
G., W., & Atkinson, K. (1994) · Mathematics of Computation · doi:10.2307/2153423 · Cited by 1,253
Texture and reflection in computer generated images
Blinn, J. F., & Newell, M. E. (1976) · Communications of the ACM · doi:10.1145/360349.360353 · Cited by 772
Methods of Mathematical Physics: Partial Differential Equations
Courant, R., & Hilbert, D. (1989) · doi:10.1002/9783527617234 · Cited by 735
Mathematica: a system for doing mathematics by computer (2nd ed.)
Wolfram, S. (1991) · Cited by 593
Differential geometry of curves and surfaces
Krim, H., & Hamza, A. B. (2015) · Cambridge University Press eBooks · doi:10.1017/cbo9781139523967.005 · Cited by 588
Cited by
Discrete Differential-Geometry Operators for Triangulated 2-Manifolds
Meyer, M., Desbrun, M., Schröder, P., & Barr, A. H. (2003) · Mathematics and Visualization · doi:10.1007/978-3-662-05105-4_2 · Cited by 1,889
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
Reverse engineering of geometric models—an introduction
Várady, T., Martin, R. R., & Cox, J. (1997) · Computer-Aided Design · doi:10.1016/s0010-4485(96)00054-1 · Cited by 1,116
Multiresolution analysis for surfaces of arbitrary topological type
Lounsbery, M., DeRose, T. D., & Warren, J. (1997) · ACM Transactions on Graphics · doi:10.1145/237748.237750 · Cited by 760
Shape, Illumination, and Reflectance from Shading
Barron, J. T., & Malik, J. (2015) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2014.2377712 · Cited by 656
Metadata
- Authors
- Moreton, H. P., & Séquin, C. H.
- Venue
- Proceedings of the 19th annual conference on Computer graphics and interactive techniques
- Publisher
- ACM
- Published
- 1992-07
- Pages
- 167-176
- OpenAlex
- W2099085357
- Cited by
- 327
- References
- 11
- FWCI
- 27.68
- 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: Functional optimization for fair surface design. https://app.cochat.ai/papers/10.1145/133994.134035
- The paper
- Moreton, H. P., & Séquin, C. H. (1992). Functional optimization for fair surface design. Proceedings of the 19th annual conference on Computer graphics and interactive techniques. https://doi.org/10.1145/133994.134035
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.