Efficient, fair interpolation using Catmull-Clark surfaces
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Piecewise smooth surface reconstruction
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
An efficient surface intersection algorithm based on lower-dimensional formulation
ACM Transactions on Graphics (TOG)
Subdivision surfaces in character animation
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Interpolating nets of curves by smooth subdivision surfaces
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Combined subdivision schemes for the design of surfaces satisfying boundary conditions
Computer Aided Geometric Design
Computer Aided Geometric Design
Computer Aided Geometric Design
Piecewise smooth subdivision surfaces with normal control
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Proceedings of the conference on Visualization '01
Normal bounds for subdivision-surface interference detection
Proceedings of the conference on Visualization '01
Sharp features on multiresolution subdivision surfaces
Graphical Models - Pacific graphics 2001
Computer Aided Geometric Design
Topologically consistent trimmed surface approximations based on triangular patches
Computer Aided Geometric Design
Rendering trimmed implicit surfaces and curves
AFRIGRAPH '04 Proceedings of the 3rd international conference on Computer graphics, virtual reality, visualisation and interaction in Africa
Differentiable parameterization of Catmull-Clark subdivision surfaces
Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Optimization methods for scattered data approximation with subdivision surfaces
Graphical Models - Solid modeling theory and applications
Computational formula of depth for Catmull-Clark subdivision surfaces
Journal of Computational and Applied Mathematics - Special issue: The international symposium on computing and information (ISCI2004)
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
ACM SIGGRAPH 2008 papers
International Journal of Computer Applications in Technology
Transfinite Interpolation for Well-Definition in Error Analysis in Solid Modelling
Reliable Implementation of Real Number Algorithms: Theory and Practice
Integration of CAD and boundary element analysis through subdivision methods
Computers and Industrial Engineering
Approximate swept volumes of NURBS surfaces or solids
Computer Aided Geometric Design
Single-set and class-of-sets semantics for geometric models
Computer-Aided Design
Subdivision surfaces for CAD-an overview
Computer-Aided Design
Technical Section: Method of trimming PDE surfaces
Computers and Graphics
Modelling function-based mixed-dimensional objects with attributes
Heterogeneous objects modelling and applications
Multi-step subdivision algorithm for chaikin curves
CIS'04 Proceedings of the First international conference on Computational and Information Science
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
Beyond Catmull–Clark? A Survey of Advances in Subdivision Surface Methods
Computer Graphics Forum
| Hi-index | 0.00 |
Trimming is an important primitive operation in geometric modeling. It is also the root of many numerical and topological problems in modern NURBS based CAGD systems. In this paper we introduce a new method for trimming subdivision surfaces. It is based on the use of combined subdivision schemes to guarantee exact interpolation of trim curves. The latter ensures, for example, that if two surfaces share a trim curve, they will meet exactly at the trim curve. In contrast to traditional approaches to trimming (e.g., for NURBS) we construct a new control mesh with each trim operation. This causes a perturbation of the surface near the trim region, which we control through the use of multiresolution details. These are computed rapidly and at low cost with the help of a novel set of quasi-interpolation operators. We demonstrate our algorithm with a number of examples.