ABSTRACT
In this paper we describe a method for computing approximate results of boolcan operations (union, intersection, difference) applied to free-form solids bounded by multiresolution subdivision surfaces.
We present algorithms for generating a control mesh for a multiresolution surface approximating the result, optimizing the parameterization of the new surface with respect to the original surfaces, and fitting the new surface to the geometry of the original surfaces. Our algorithms aim to minimize the size and optimize the quality of the new control mesh. The original control meshes are modified only in a neighborhood of the intersection.
While the main goal is to obtain approximate results, high-accuracy approximations are also possible at additional computational expense, if the topology of the intersection curve is resolved correctly.
Index Terms
- Approximate Boolean operations on free-form solids
Recommendations
Interactive boolean operations on surfel-bounded solids
SIGGRAPH '03: ACM SIGGRAPH 2003 PapersIn this paper we present an algorithm to perform interactive boolean operations on free-form solids bounded by surfels. We introduce a fast inside-outside test to check whether surfels lie within the bounds of another surfel-bounded solid. This enables ...
Including and optimizing shape parameters in Doo-Sabin subdivision surfaces for interpolation
SPM '07: Proceedings of the 2007 ACM symposium on Solid and physical modelingThis paper considers the problems of how to introduce shape parameters into recursive subdivision schemes for additional shape control and how to find appropriate values of shape parameters to improve the quality of subdivision surface shapes. Following ...
Real-Time Creased Approximate Subdivision Surfaces with Displacements
We present an extension of Loop and Schaefer's approximation of Catmull-Clark surfaces (ACC) for surfaces with creases and corners. We discuss the integration of ACC into Valve's Source game engine and analyze performance of our implementation.
Comments