A parallel multistage method for surface/surface intersection

https://doi.org/10.1016/0167-8396(93)90042-2Get rights and content

Abstract

A global divide-and-conquer method and a local marching method are combined into a massively parallel algorithm for surface/surface intersection. Special attention is given to the comparison of bounding boxes and to the safe and efficient calculation of all components of the intersection. The computational complexity of the algorithm is analyzed, and a series of examples is provided for illustration of the theoretical results.

References (16)

There are more references available in the full text version of this article.

Cited by (7)

View all citing articles on Scopus
View full text