Translator Disclaimer
1 November 1992 Robust techniques for curve and surface intersections
Author Affiliations +
Proceedings Volume 1830, Curves and Surfaces in Computer Vision and Graphics III; (1992)
Event: Applications in Optical Science and Engineering, 1992, Boston, MA, United States
The problems of computing the intersection of curves and surfaces are fundamental to computer graphics and geometric and solid modeling. Earlier algorithms were based either on subdivision methods or algebraic techniques. They are generally restricted to simple intersections. It has been generally regarded that algebraic approach is impractical due to numerical problems on higher degree curves and surfaces (beyond cubics). In our earlier work we have applied Elimination theory and reduced the problem of intersections of curves and surfaces to matrix computations. These include Gauss elimination, matrix inversion, singular value decomposition, eigenvalues and eigenvectors etc. In this paper, we present robust algorithms based on techniques from linear algebra and numerical analysis for computing the zero dimensional intersections of curves and surface. These include intersection of parametric and algebraic curves and curve-surface intersections. In particular, we present a robust algorithm for computer higher order intersections.
© (1992) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Dinesh Manocha "Robust techniques for curve and surface intersections", Proc. SPIE 1830, Curves and Surfaces in Computer Vision and Graphics III, (1 November 1992);

Back to Top