A parallel multistage method for surface/surface intersection

DOI10.1016/0167-8396(93)90042-2zbMath0779.65095OpenAlexW2089554695MaRDI QIDQ687461

Heiko Bürger, Robert Schaback

Publication date: 25 October 1993

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

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

zbMATH Keywords

computational complexityuniquenessparallel algorithmmultistage methoddivide-and-conquer methodbounding boxesmarching methodsurface/surface intersection

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Parallel numerical computation (65Y05) Descriptive geometry (51N05)

Related Items (2)

A New Intersection Algorithm for Parametric Surfaces Based on Linear Interval Estimations ⋮ A fast semi-Lagrangian contouring method for moving interfaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A marching method for parametric surface/surface intersection
• Convergence of a surface/surface intersection algorithm
• Surface/surface intersection
• Loop detection in surface patch intersections
• On determining start points for a surface/surface intersection algorithm
• Error estimates for approximations from control nets
• An extended continuous Newton method
• Implementation of a divide-and-conquer method for intersection of parametric surfaces

This page was built for publication: A parallel multistage method for surface/surface intersection