This paper describes a robust algorithm for computing all parts of the intersection curve of two general parametric surfaces. The algorithm follows a divide-and-conquer approach. Surfaces (and parts of them) are enclosed by tight parallel epipeds and axis aligned bounding boxes. If two bounding volumes intersect, one surface is split into two patches. This step is repeated recur-sively for both patches and the other surface until a predeened termination condition is satissed. The result is an approximation to the intersection curve in the parameter domains of both surfaces and in object space. Interval arithmetic is used for the computation of bounding volumes and to guarantee correctness of the results.
[1]
Michael I. Jordan,et al.
Surface/surface intersection
,
1987,
Comput. Aided Geom. Des..
[2]
Kevin G. Suffern,et al.
Interval methods in computer graphics
,
1991,
Comput. Graph..
[3]
Michael Gleicher,et al.
An interval refinement technique for surface intersection
,
1992
.
[4]
Sudhir P. Mudur,et al.
Interval Methods for Processing Geometric Objects
,
1984,
IEEE Computer Graphics and Applications.
[6]
Chaman L. Sabharwal,et al.
Implementation of a divide-and-conquer method for intersection of parametric surfaces
,
1985,
Comput. Aided Geom. Des..