Aspects of algorithms for manifold intersection

MaRDI QIDQ4356934zbMATH OpenFDO

Authors Tor Dokken

Publication date 5 October 1997

zbMATH Keywords

generic structureintersection identification strategiesintersection tolerancemanifold intersection algorithms

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10)

Review text

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].

Recommendations

• scientific article; zbMATH DE number 4119474
• A SURFACE INTERSECTION ALGORITHM BASED ON LOOP DETECTION
• Surface/surface intersection
• On computing the intersection of a pair of algebraic surfaces

Cited in

(12)

• Interval implicitization of rational curves
• Numerical stability of surface implicitization
• High-order parametric polynomial approximation of conic sections
• Approximate implicitization using linear algebra
• scientific article; zbMATH DE number 4119474 (Why is no real title available?)
• Intersection Algorithms and CAGD
• Efficient algorithms for stable manifolds
• Circular arc approximation by hexic polynomial curves
• Bézier clipping is quadratically convergent
• Computing intersections of planar spline curves using knot insertion
• On parametric polynomial circle approximation
• A new method approximating offset curve by Bézier curve using parallel derivative curves

This page was built for publication: Aspects of algorithms for manifold intersection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4356934)