The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Interactive multi-resolution modeling on arbitrary meshes
Abstract
During the last years the concept of multi-resolution modeling has gained special attention in many fields of computer graphics and geometric modeling. In this paper we generalize powerful multiresolution techniques to arbitrary triangle meshes without requiring subdivision connectivity. Our major observation is that the hierarchy of nested spaces which is the structural core element of most multi-resolution algorithms can be replaced by the sequence of intermediate meshes emerging from the application of incremental mesh decimation. Performing such schemes with local frame coding of the detail coefficients already provides effective and efficient algorithms to extract multi-resolution information from unstructured meshes. In combination with discrete fairing techniques, i.e., the constrained minimization of discrete energy functionals, we obtain very fast mesh smoothing algorithms which are able to reduce noise from a geometrically specified frequency band in a multiresolution decomposition. Putting mesh hierarchies, local frame coding and multi-level smoothing together allows us to propose a flexible and intuitive paradigm for interactive detail-preserving mesh modification. We show examples generated by our mesh modeling tool implementation to demonstrate its functionality.
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
Daubechies, I. (1992) · doi:10.1137/1.9781611970104 · Cited by 15,979
Surface simplification using quadric error metrics
Garland, M., & Heckbert, P. S. (1997) · Proceedings of the 24th annual conference on Computer graphics and interactive techniques - SIGGRAPH '97 · doi:10.1145/258734.258849 · Cited by 3,412
Hoppe, H. (1996) · Proceedings of the 23rd annual conference on Computer graphics and interactive techniques · doi:10.1145/237170.237216 · Cited by 2,817
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
Hierarchical B-spline refinement
Forsey, D. R., & Bartels, R. H. (1988) · ACM SIGGRAPH Computer Graphics · doi:10.1145/378456.378512 · Cited by 624
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
Finkelstein, A., & Salesin, D. H. (1994) · Proceedings of the 21st annual conference on Computer graphics and interactive techniques - SIGGRAPH '94 · doi:10.1145/192161.192223 · Cited by 256
Hierarchical and variational geometric modeling with wavelets
Gortler, S. J., & Cohen, M. F. (1995) · ACM Symposium on Interactive 3D Graphics (I3D) · doi:10.1145/199404.199410 · Cited by 96
Cited by
Implicit fairing of irregular meshes using diffusion and curvature flow
Desbrun, M., Meyer, M., Schröder, P., & Barr, A. H. (1999) · Proceedings of the 26th annual conference on Computer graphics and interactive techniques - SIGGRAPH '99 · doi:10.1145/311535.311576 · Cited by 1,538
Learning a model of facial shape and expression from 4D scans
Li, T., Bolkart, T., Black, M. J., Li, H., & Romero, J. (2017) · ACM Transactions on Graphics · doi:10.1145/3130800.3130813 · Cited by 1,223
Sorkine, O., Cohen-Or, D., Lipman, Y., Alexa, M., Rössl, C., & Seidel, H.-P. (2004) · Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing · doi:10.1145/1057432.1057456 · Cited by 1,154
Self-citationSparse matrix solvers on the GPU: conjugate gradients and multigrid
Bolz, J., Farmer, I., Grinspun, E., & Schröder, P. (2005) · ACM SIGGRAPH 2005 Courses on - SIGGRAPH '05 · doi:10.1145/1198555.1198781 · Cited by 741
Lee, C. H., Varshney, A., & Jacobs, D. W. (2005) · ACM Transactions on Graphics · doi:10.1145/1073204.1073244 · Cited by 667
Metadata
- Authors
- Kobbelt, L., Campagna, S., Vorsatz, J., & Seidel, H.-P.
- Venue
- Proceedings of the 25th annual conference on Computer graphics and interactive techniques - SIGGRAPH '98
- Publisher
- ACM Press
- Published
- 1998
- Pages
- 105-114
- OpenAlex
- W581389087
- Cited by
- 655
- References
- 8
- FWCI
- 15.08
- 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.