Surface algorithms using bounds on derivatives
Computer Aided Geometric Design
Box splines
Piecewise smooth subdivision surfaces with normal control
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Representations for Rigid Solids: Theory, Methods, and Systems
ACM Computing Surveys (CSUR)
Approximate Boolean operations on free-form solids
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Normal bounds for subdivision-surface interference detection
Proceedings of the conference on Visualization '01
Tight Bounding Volumes for Subdivision Surfaces
PG '98 Proceedings of the 6th Pacific Conference on Computer Graphics and Applications
Distance between a Catmull-Clark subdivision surface and its limit mesh
Proceedings of the 2007 ACM symposium on Solid and physical modeling
Error Analysis for Operations in Solid Modeling in the Presence of Uncertainty
SIAM Journal on Scientific Computing
Set Membership Classification: A Unified Approach to Geometric Intersection Problems
IEEE Transactions on Computers
Numerical Methods in Scientific Computing: Volume 1
Numerical Methods in Scientific Computing: Volume 1
Stable maintenance of point set triangulations in two dimensions
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Conditions for use of a non-selfintersection conjecture
Computer Aided Geometric Design
Beyond Catmull–Clark? A Survey of Advances in Subdivision Surface Methods
Computer Graphics Forum
| Hi-index | 0.00 |
This paper describes an algorithm to perform Boolean operations, based on the use of limit meshes, in the case when input objects are defined in terms of triangular meshes and Loop subdivision. The focus of the paper is on robustness, including error bounds and numerical methods for the a posteriori validation of topological form.