On determining start points for a surface/surface intersection algorithm

DOI10.1016/0167-8396(91)90013-2zbMath0742.65106MaRDI QIDQ1183533

Gregor Müllenheim

Publication date: 28 June 1992

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8396(91)90013-2

zbMATH Keywords

computer aided design; search algorithm; computational geometry; starting values; Newton-type curve/curve or surface/surface intersection methods

Mathematics Subject Classification ID

65H10: Numerical computation of solutions to systems of equations

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

65D18: Numerical aspects of computer graphics, image analysis, and computational geometry

51N05: Descriptive geometry

Related Items

Computing intersection and self-intersection loci of parametrized surfaces using regular systems and Gröbner bases, A parallel multistage method for surface/surface intersection, NURBS approximation of surface / surface intersection curves, A complete and nonoverlapping tracing algorithm for closed loops

Cites Work

• A marching method for parametric surface/surface intersection
• On computing the intersection of a pair of algebraic surfaces
• Convergence of a surface/surface intersection algorithm
• Surface/surface intersection
• Implementation of a divide-and-conquer method for intersection of parametric surfaces