Original article

The Visual Computer

, Volume 16, Issue 7, pp 386-395

First online:

Surface approximation to scanned data

  • L.A. PieglAffiliated withDepartment of Computer Science & Engineering, University of South Florida, 4202 Fowler Avenue, ENG 118, Tampa, FL 33620, USA e-mail: piegl@grad.csee.usf.edu
  • , W. TillerAffiliated withGeomWare, Inc., 3035 Great Oak Circle, Tyler, TX 75703, USA e-mail: geomware@gower.net

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

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, 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.

Key words: Data approximation – Reverse engineering – B-splines – Curves and surfaces – Algorithms