| authors |
Lasser, Dieter |
| year |
1986 |
| title |
Intersection of parametric Surfaces in the Bernstein-Bexier Representation |
| source |
Computer Aided Design May, 1986. vol. 18: pp. 188-192 : ill. includes bibliography. |
| summary |
A user-friendly 'divide-and-conquer' algorithm, which finishes quickly, is presented for finding all the intersection curves between two parametric surfaces in the Bernstein-Bezier 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 plane-plane-intersections using planes defined by Bezier points of the refined Bezier nets. Contour lines can also be produced by the algorithm |
| keywords |
divide-and-conquer, CAD, algorithms, parametrization, curved surfaces, Bezier, curves, intersection |
| series |
CADline |
| references |
Content-type: text/plain
|
| last changed |
1999/02/12 15:09 |
|
