Journal
VISUAL COMPUTER
Volume 16, Issue 7, Pages 386-395Publisher
SPRINGER
DOI: 10.1007/PL00013393
Keywords
data approximation; reverse engineering; B-splines; curves and surfaces; algorithms
Categories
Ask authors/readers for more resources
A method to approximate scanned data points with a B-spline surface is presented. The data are assumed to be organized in the form of Q(i,j), i = 0, ..., n; j = 0, ..., m(i), i.e., in a row-wise fashion. The method produces a C-(p-1,C-q-1) continuous surface (p and q are the required degrees) that does not deviate from the data by more than a user-specified tolerance. The parametrization of the surface is not affected negatively by the distribution of the points in each row, and it can be influenced by a user-supplied knot vector.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available