Computer Aided Geometric Design - Special issue: Topics in CAGD
Loop detection in surface patch intersections
Computer Aided Geometric Design
Computer Aided Geometric Design
A marching method for parametric surface/surface intersection
Computer Aided Geometric Design
On determining start points for a surface/surface intersection algorithm
Computer Aided Geometric Design
Free form surface analysis using a hybrid of symbolic and numeric computation
Free form surface analysis using a hybrid of symbolic and numeric computation
Tangent, normal, and visibility cones on Be´zier surfaces
Computer Aided Geometric Design
Modelling volumes bounded by b-spline surfaces
Modelling volumes bounded by b-spline surfaces
Feature-based process planning and automatic numerical control part programming
Feature-based process planning and automatic numerical control part programming
Self-intersection detection and elimination in freeform curves and surfaces
Computer-Aided Design
On NURBS algorithms using tangent cones
Computer Aided Geometric Design
Surface self-intersection computation via algebraic decomposition
Computer-Aided Design
| Hi-index | 0.00 |
To unambiguously represent a solid volume, it is necessary to identify and trim away extraneous and distracting parts caused by self-intersecting regions of the boundary surface. We define self-intersection as a global intrinsic property of the geometry and introduce a necessary condition for surface self-intersection, that can be computed from the normal and tangent bounding cones of the surface. Therefore, a surface that fails the condition cannot have any self-intersection. Using this property, we develop a divide-and-conquer algorithm to find the self-intersection curves of surfaces. We also introduce a method to locate a miter point of a vanishing self-intersection curve. Miter points can cause slow or false convergence using existing numerical intersection methods.