Recursive intersection algorithms including approximate implicitization
In industrial systems numeric intersection algorithms are used rather than exact intersection methods. However, many approaches to numeric intersection algorithms exist with different levels of guaranteed quality of intersection results.
At the core of recursive intersection algorithms are strategies to determine if an intersection is simple (all intersection tracks are touching the boundary of one of the surface patches intersected), or if there is a closed intersection curve in the interior of both surfaces intersected.
A protype surface surface and surface self.intersection algorithm is part of the results of GAIA II. These protypes will be made available as Open Source under the GNU GPL license in the second half of 2005.