Cut-and-paste editing of multiresolution surfaces
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Level set surface editing operators
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Normal bounds for subdivision-surface interference detection
Proceedings of the conference on Visualization '01
LV-RV Shape Modeling Based on a Blended Parameterized Model
MICCAI '02 Proceedings of the 5th International Conference on Medical Image Computing and Computer-Assisted Intervention-Part I
Sharp features on multiresolution subdivision surfaces
Graphical Models - Pacific graphics 2001
Interactive boolean operations on surfel-bounded solids
ACM SIGGRAPH 2003 Papers
Domain decomposition for multiresolution analysis
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Computer Aided Geometric Design
Topologically consistent trimmed surface approximations based on triangular patches
Computer Aided Geometric Design
Mesh editing with poisson-based gradient field manipulation
ACM SIGGRAPH 2004 Papers
Boolean Operations with Implicit and Parametric Representation of Primitives Using R-Functions
IEEE Transactions on Visualization and Computer Graphics
Optimization methods for scattered data approximation with subdivision surfaces
Graphical Models - Solid modeling theory and applications
ACM SIGGRAPH 2006 Papers
Modeling with multiresolution subdivision surfaces
ACM SIGGRAPH 2006 Courses
Optimization techniques for approximation with subdivision surfaces
SM '04 Proceedings of the ninth ACM symposium on Solid modeling and applications
Constrained free form deformation as a tool for rapid manufacturing
Computers in Industry
ACM SIGGRAPH 2008 papers
Adaptive geometry compression based on four-point interpolatory subdivision schemes with labels
International Journal of Computer Mathematics - Computer Vision and Pattern Recognition
Robustness of Boolean Operations on Subdivision-Surface Models
Numerical Validation in Current Hardware Architectures
Subdivision surfaces for CAD-an overview
Computer-Aided Design
A graph based algorithm for intersection of subdivision surfaces
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Non-Photorealistic Animation and Rendering
Subdivision depth computation for extra-ordinary catmull-clark subdivision surface patches
CGI'06 Proceedings of the 24th international conference on Advances in Computer Graphics
Fast intersections for subdivision surfaces
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Practical boolean operations on point-sampled models
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
A marching method for computing intersection curves of two subdivision solids
IMA'05 Proceedings of the 11th IMA international conference on Mathematics of Surfaces
Adaptive geometry compression based on 4-point interpolatory subdivision schemes
IWICPAS'06 Proceedings of the 2006 Advances in Machine Vision, Image Processing, and Pattern Analysis international conference on Intelligent Computing in Pattern Analysis/Synthesis
Beyond Catmull–Clark? A Survey of Advances in Subdivision Surface Methods
Computer Graphics Forum
Boolean operations on surfel-bounded solids using programmable graphics hardware
SPBG'04 Proceedings of the First Eurographics conference on Point-Based Graphics
Fast and accurate evaluation of regularized Boolean operations on triangulated solids
Computer-Aided Design
| Hi-index | 0.00 |
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.