Estimating subdivision depth of Catmull-Clark surfaces
- 32 Downloads
In this paper, both general and exponential bounds of the distance between a uniform Catmull-Clark surface and its control polyhedron are derived. The exponential bound is independent of the process of subdivision and can be evaluated without recursive subdivision. Based on the exponential bound, we can predict the depth of subdivision within a user-specified error tolerance. This is quite useful and important for pre-computing the subdivision depth of subdivision surfaces in many engineering applications such as surface/surface intersection, mesh generation, numerical control machining and surface rendering.
KeywordsCatmull-Clark surface subdivision depth control polyhedron approximation error
Unable to display preview. Download preview PDF.
- Lutterkort D, Peters J. The distance between a uniform B-spline and its control polygon. Technical Report TR-98-013, available from http://www.cise.uft.edu/research/tech-reports.Google Scholar
- Kobbelt L, Daubert K, Seidel H. Ray tracing of subdivision surfaces.Eurographics Rendering Workshop, 1998, Vienna, Austria, pp. 69–80.Google Scholar
- Hausdorff F. Set Theory, Chelsea (Translated from German), 1978.Google Scholar