Surface intersection using parallelism

DOI10.1016/0167-8396(94)90024-8zbMath0806.65151OpenAlexW2073457642MaRDI QIDQ1315806

Wolfgang W. Bein, Long Chyr Chang, Edward S. Angel

Publication date: 17 April 1994

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

Full work available at URL: https://doi.org/10.1016/0167-8396(94)90024-8

zbMATH Keywords

parallel algorithmsalgorithm complexitysurface/surface intersectionfree-form solid modelinglook ahead-subdivision algorithmmacro-subdivision algorithmMIND shared memory machinespipelined MIND machines

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Descriptive geometry (51N05)

Related Items (2)

Improved surface bounds based on derivatives ⋮ NURBS solid modeling for the three-dimensional limit analysis of curved rigid block structures

Cites Work

• Surface algorithms using bounds on derivatives
• Surface/surface intersection
• Implementation of a divide-and-conquer method for intersection of parametric surfaces
• A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces
• Unnamed Item

This page was built for publication: Surface intersection using parallelism