authors 
Lasser, Dieter 
year 
1986 
title 
Intersection of parametric Surfaces in the BernsteinBexier Representation 
source 
Computer Aided Design May, 1986. vol. 18: pp. 188192 : ill. includes bibliography. 
summary 
A userfriendly 'divideandconquer' algorithm, which finishes quickly, is presented for finding all the intersection curves between two parametric surfaces in the BernsteinBezier representation. The underlying idea of the algorithm is to deal with the Bezier net instead of the surface description itself. By alternately subdividing the Bezier nets, and estimating the intersection area, a finite element mesh is created in the intersection region of the surfaces. The intersection is approximated by polygons computed by planeplaneintersections using planes defined by Bezier points of the refined Bezier nets. Contour lines can also be produced by the algorithm 
keywords 
divideandconquer, CAD, algorithms, parametrization, curved surfaces, Bezier, curves, intersection 
series 
CADline 
references 
Contenttype: text/plain

last changed 
1999/02/12 14:09 
