| authors |
Peng, Q. S. |
| year |
1984 |
| title |
An Algorithm for Finding the Intersection Lines Between Two B-Spline Surfaces |
| source |
Computer Aided Design July, 1984. vol. 16: pp. 191-196 : ill. includes bibliography. |
| summary |
A divide-and-conquer algorithm is presented for finding all the intersection lines between two B-spline surfaces. Each surface is organized as an n-branch tree. For each intersection line, an initial point is detected after a depth-first 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, B-splines, techniques, divide-and- conquer, intersection, curves, curved surfaces, representation |
| series |
CADline |
| references |
Content-type: text/html
Access Temporarily Restricted
Access Temporarily Restricted
Too many requests detected. Please wait 60 seconds or verify that you are a human.
If you are a human user and need immediate access, you can click the button below to continue:
If you continue to experience issues, please open a ticket at
papers.cumincad.org/helpdesk
|
| last changed |
2003/06/02 10:24 |
|
