The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Curve and surface smoothing without shrinkage
Abstract
For a number of computational purposes, including visualization of scientific data and registration of multimodal medical data, smooth curves must be approximated by polygonal curves, and surfaces by polyhedral surfaces. An inherent problem of these approximation algorithms is that the resulting curves and surfaces appear faceted. Boundary-following and iso-surface construction algorithms are typical examples. To reduce the apparent faceting, smoothing methods are used. In this paper, we introduce a new method for smoothing piecewise linear shapes of arbitrary dimension and topology. This new method is in fact a linear low-pass filter that removes high-curvature variations, and does not produce shrinkage. Its computational complexity is linear in the number of edges or faces of the shape, and the required storage is linear in the number of vertices.>
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
Computer graphics: principles and practice
(2014) · Choice Reviews Online · doi:10.5860/choice.51-2713 · Cited by 4,651
Witkin, A. P. (1987) · Readings in Computer Vision · doi:10.1016/b978-0-08-051581-6.50036-2 · Cited by 2,359
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
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
Self-citationScale-space filtering: A new approach to multi-scale description
Witkin, A. (2005) · ICASSP '84. IEEE International Conference on Acoustics, Speech, and Signal Processing · doi:10.1109/icassp.1984.1172729 · Cited by 1,086
Computer graphics — principles and practice
Leitáo, V. (1992) · Advances in Engineering Software · doi:10.1016/0965-9978(92)90087-v · Cited by 820
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-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
Organization of smooth image curves at multiple scales
Lowe, D. G. (1989) · International Journal of Computer Vision · doi:10.1007/bf00126428 · Cited by 183
Three-Dimensional Object Recognition Systems
Jain, A. K., & Flynn, P. J. (1993) · Elsevier eBooks · Cited by 80
Cited by
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
Self-citationMorpho and Rvcg – Shape Analysis in R
Schlager, S. (2017) · Statistical Shape and Deformation Analysis · doi:10.1016/b978-0-12-810493-4.00011-0 · Cited by 894
Shojima, M., Oshima, M., Takagi, K., Torii, R., Hayakawa, M., Katada, K., Morita, A., & Kirino, T. (2004) · Stroke · doi:10.1161/01.str.0000144648.89172.0f · Cited by 790
Gosselin, M.-C., Neufeld, E., Moser, H., Huber, E., Farcito, S., Gerber, L., Jedensjö, M., Hilber, I., Gennaro, F. D., Lloyd, B., et al. (2014) · Physics in Medicine and Biology · doi:10.1088/0031-9155/59/18/5287 · Cited by 520
Suggestive contours for conveying shape
DeCarlo, D., Finkelstein, A., Rusinkiewicz, S., & Santella, A. (2003) · ACM SIGGRAPH 2003 Papers · doi:10.1145/1201775.882354 · Cited by 450
Metadata
- Authors
- Taubin, G.
- Venue
- Proceedings of IEEE International Conference on Computer Vision
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2002-11-19
- Pages
- 852-857
- OpenAlex
- W2148952796
- Cited by
- 420
- References
- 12
- FWCI
- 9.51
- 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.