Computer Aided Geometric Design - Special issue: Topics in CAGD
Computer Aided Geometric Design
Surface-to-Surface Intersections
IEEE Computer Graphics and Applications - Special issue on computer-aided geometric design
Subdivision surfaces in character animation
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Approximate Boolean operations on free-form solids
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
BOOLE: A System to Compute Boolean Combinations of Sculptured Solids
BOOLE: A System to Compute Boolean Combinations of Sculptured Solids
Graph Theory With Applications
Graph Theory With Applications
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 |
Computing surface intersections is a fundamental problem in geometric modeling. Any boolean operation can be seen as an intersection calculation followed by a selection of the parts necessary for building the surface of the resulting object. A robust and efficient algorithm to compute intersection on subdivision surfaces (surfaces generated by the Loop scheme) is proposed here. This algorithm relies on the concept of a bipartite graph which allows the reduction of the number of faces intersection tests. Intersection computations are accelerated by the use of the bipartite graph and the neighborhood of intersecting faces at a given level of subdivision to deduce intersecting faces at the following levels of subdivision.