Aspects of algorithms for manifold intersection (Q4356934)

The paper addresses the following topics that are central for the development of new intersection algorithms: (1) A generic structure for the intersection algorithms that are independent of the object dimensions and the space dimensions in which the objects lie; (2) Intersection tolerances and strategies for intersection identification; (3) Conditions to ensure that non-internal loops exist in the intersection of smooth manifolds. The following basic structure of the generic intersection algorithm for two closed and bounded manifolds \(A\) and \(B\) is illustrative. ALGORITHM Intersect \((A,B)\) Intersect (Boundary \((A)\), \(B\)); Intersect (\(A\), Boundary \((B)\)); IF: All objects resulting from the intersection touch the boundary of \(A\) or \(B\); THEN: Describe the intersection results within an appropriate tolerance, and connect to boundary intersections; ELSE: Subdivide \(A\) and \(B\) in an appropriate way into smaller pieces; FOR: All subpieces \(\text{sub}_i(A)\) of \(A\); FOR: All subpieces \(\text{sub}_j(B)\) of \(B\); Intersect \((\text{sub}_i(A),\text{sub}_j(B))\); Connect the results of the subproblem intersections. For the entire collection see [Zbl 0863.00021].