authors 
Peng, Q. S. 
year 
1984 
title 
An Algorithm for Finding the Intersection Lines Between Two BSpline Surfaces 
source 
Computer Aided Design July, 1984. vol. 16: pp. 191196 : ill. includes bibliography. 
summary 
A divideandconquer algorithm is presented for finding all the intersection lines between two Bspline surfaces. Each surface is organized as an nbranch tree. For each intersection line, an initial point is detected after a depthfirst search along one tree, i.e. the host tree. Extrapolation methods are then used to trace the entire length of the line, thus the line appears naturally in a continuous form. Efficiency of the algorithm is achieved by employing of an adaptive division strategy and by the careful choice of the representation basis of the patches on both surfaces 
keywords 
logic, algorithms, Bsplines, techniques, divideand conquer, intersection, curves, curved surfaces, representation 
series 
CADline 
references 
Contenttype: text/plain

last changed 
2003/06/02 08:24 
