Complete and non-overlapping marching along a closed regular intersection curve ?
In this paper we present an algorithm for estimating the rotation index of a closed regular intersection curve from its singular points. On the basis of this index we have also devised a procedure that guarantees that a closed intersection curve will be traced completely, without overlapping. Combining this procedure with marching steps derived from differential geometric properties has resulted in a robust intersection technique.
surfacesurface intersections marching algorithms closed loops