The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
A signal processing approach to fair surface design
Abstract
In this paper we describe a new tool for interactive free-form fair surface design. By generalizing classical discrete Fourier analysis to two-dimensional discrete surface signals -- functions defined on polyhedral surfaces of arbitrary topology --, we reduce the problem of surface smoothing, or fairing, to low-pass filtering. We describe a very simple surface signal low-pass filter algorithm that applies to surfaces of arbitrary topology. As opposed to other existing optimization-based fairing methods, which are computationally more expensive, this is a linear time and space complexity algorithm. With this algorithm, fairing very large surfaces, such as those obtained from volumetric medical data, becomes affordable. By combining this algorithm with surface subdivision methods we obtain a very effective fair surface design technique. We then extend the analysis, and modify the algorithm accordingly, to accommodate different types of constraints. Some constraints can be imposed without any modification of the algorithm, while others require the solution of a small associated linear system of equations. In particular, vertex location constraints, vertex normal constraints, and surface normal discontinuities across curves embedded in the surface, can be imposed with this technique. CR Categories and Subject Descriptors: I.3.3 [Computer Graphics]: Picture/image generation - display algorithms; I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling - curve, surface, solid, and object representations;J.6[Com- puter Applications]: Computer-Aided Engineering - computeraided design General Terms: Algorithms, Graphics. 1
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Kass, M., Witkin, A., & Terzopoulos, D. (1988) · International Journal of Computer Vision · doi:10.1007/bf00133570 · Cited by 17,070
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
Differential geometry of curves and surfaces
(2011) · Choice Reviews Online · doi:10.5860/choice.48-3330 · Cited by 3,706
Witkin, A. P. (1987) · Readings in Computer Vision · doi:10.1016/b978-0-08-051581-6.50036-2 · Cited by 2,359
Recursively generated B-spline surfaces on arbitrary topological meshes
Catmull, E., & Clark, J. (1978) · Computer-Aided Design · doi:10.1016/0010-4485(78)90110-0 · Cited by 2,018
Fourier Descriptors for Plane Closed Curves
Zahn, C. T., & Roskies, R. Z. (1972) · IEEE Transactions on Computers · doi:10.1109/tc.1972.5008949 · Cited by 1,860
Schroeder, W. J., Zarge, J. A., & Lorensen, W. E. (1992) · Proceedings of the 19th annual conference on Computer graphics and interactive techniques · doi:10.1145/133994.134010 · Cited by 1,464
Zippered polygon meshes from range images
Turk, G., & Levoy, M. (1994) · Proceedings of the 21st annual conference on Computer graphics and interactive techniques - SIGGRAPH '94 · doi:10.1145/192161.192241 · Cited by 1,326
Smooth Subdivision Surfaces Based on Triangles
Loop, C. (1987) · Cited by 1,319
Hoppe, H., DeRose, T., Duchamp, T., McDonald, J., & Stuetzle, W. (1993) · Proceedings of the 20th annual conference on Computer graphics and interactive techniques · doi:10.1145/166117.166119 · Cited by 1,303
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
Turk, G. (1992) · Proceedings of the 19th annual conference on Computer graphics and interactive techniques · doi:10.1145/133994.134008 · Cited by 738
Scale-space for discrete signals
Lindeberg, T. (1990) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.49051 · Cited by 620
Estimating the tensor of curvature of a surface from a polyhedral approximation
Taubin, G. (2002) · IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.1995.466840 · Cited by 558
Self-citationClosed-form solutions for physically based shape modeling and recognition
Pentland, A., & Sclaroff, S. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.85660 · Cited by 466
Direct manipulation of free-form deformations
Hsu, W. M., Hughes, J. F., & Kaufman, H. (1992) · Proceedings of the 19th annual conference on Computer graphics and interactive techniques · doi:10.1145/133994.134036 · Cited by 434
Curve and surface smoothing without shrinkage
Taubin, G. (2002) · Proceedings of IEEE International Conference on Computer Vision · doi:10.1109/iccv.1995.466848 · Cited by 420
Self-citationEfficient, fair interpolation using Catmull-Clark surfaces
Halstead, M., Kass, M., & DeRose, T. (1993) · Proceedings of the 20th annual conference on Computer graphics and interactive techniques · doi:10.1145/166117.166121 · Cited by 393
Deformable curve and surface finite-elements for free-form shape design
Celniker, G., & Gossard, D. (1991) · Proceedings of the 18th annual conference on Computer graphics and interactive techniques · doi:10.1145/122718.122746 · Cited by 340
Functional optimization for fair surface design
Moreton, H. P., & Séquin, C. H. (1992) · Proceedings of the 19th annual conference on Computer graphics and interactive techniques · doi:10.1145/133994.134035 · Cited by 327
Welch, W., & Witkin, A. (1992) · Proceedings of the 19th annual conference on Computer graphics and interactive techniques · doi:10.1145/133994.134033 · Cited by 320
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
Modeling with triangular B-splines
Greiner, G., & Seidel, H. (1994) · IEEE Computer Graphics and Applications · doi:10.1109/38.267471 · Cited by 48
Cited by
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
“In practice, we have obtained satisfactory re-sults by applying another technique: post-filtering the mesh after reconstruction using weighted averages of nearest vertex neighbors as described in [29].”
MethodDeeper Insights Into Graph Convolutional Networks for Semi-Supervised Learning
Li, Q., Han, Z., & Wu, X.-M. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11604 · Cited by 2,872
Using spin images for efficient object recognition in cluttered 3D scenes
Johnson, A. E., & Hebert, M. (1999) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.765655 · Cited by 2,599
Gortler, S. J., Grzeszczuk, R., Szeliski, R., & Cohen, M. F. (1996) · Proceedings of the 23rd annual conference on Computer graphics and interactive techniques · doi:10.1145/237170.237200 · Cited by 2,458
Graph convolutional networks: a comprehensive review
Zhang, S., Tong, H., Xu, J., & Maciejewski, R. (2019) · Computational Social Networks · doi:10.1186/s40649-019-0069-y · Cited by 1,888
Metadata
- Authors
- Taubin, G.
- Venue
- Proceedings of the 22nd annual conference on Computer graphics and interactive techniques - SIGGRAPH '95
- Publisher
- ACM Press
- Published
- 1995
- Pages
- 351-358
- OpenAlex
- W2079017595
- Cited by
- 1,855
- References
- 24
- FWCI
- 5.30
- Type
- conference paper
- 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
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.