Published February 11, 2023
| public
Book Section - Chapter
Fitting subdivision surfaces
- Creators
- Litke, Nathan
- Levin, Adi
-
Schröder, Peter
Abstract
We introduce a new algorithm for fitting a Catmull-Clark subdivision surface to a given shape within a prescribed tolerance, based on the method of quasi-interpolation. The fitting algorithm is fast, local and scales well since it does not require the solution of linear systems. Its convergence rate is optimal for regular meshes and our experiments show that it behaves very well for irregular meshes. We demonstrate the power and versatility of our method with examples from interactive modeling, surface fitting, and scientific visualization.
Additional Information
This work has been supported in part by NSF (DMS-9874082, DMS-9872890, ACI-9982273), Alias|Wavefront, Pixar, Microsoft, Intel, Lucent, and the Packard Foundation. Special thanks to Geoff Banner, Khrysaundt Koenig, Rick Kogucki, and Cory Mogk for modeling, lighting, and texturing, and to Igor Guskov and Santiago V. Lombeyda for help with the fluids dataset. Datasets are courtesy of Cyberware as well as Andy Cook and Paul Dimotakis.Additional details
- Eprint ID
- 119211
- Resolver ID
- CaltechAUTHORS:20230210-463137000.2
- DMS-9874082
- NSF
- DMS-9872890
- NSF
- ACI-9982273
- NSF
- Alias|wavefront
- Pixar
- Microsoft
- Intel
- Lucent Technologies
- David and Lucile Packard Foundation
- Created
-
2023-02-11Created from EPrint's datestamp field
- Updated
-
2023-02-11Created from EPrint's last_modified field