Skip to main content
Log in

Surface approximation to scanned data

  • Original article
  • Published:
The Visual Computer Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Piegl, L., Tiller, W. Surface approximation to scanned data. Visual Comp 16, 386–395 (2000). https://doi.org/10.1007/PL00013393

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00013393

Navigation