By Topic

Adaptive hierarchical b-spline surface approximation of large-scale scattered data

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Weiqiang Zhang ; Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing, China ; Zesheng Tang ; Jie Li

A fast algorithm for large scale scattered data approximation is described. The algorithm exploits a coarse-to-fine hierarchical control lattice to fit the scattered data. In this algorithm, the refinement process is only located in the regions where the error between the scattered data and the resulting surface is greater than a specified tolerance. A recursive algorithm is used to find these regions. In order to ensure the C2-continuity of the resulting surfaces, we introduce an additional method to get the boundary control points around the subcontrol lattice. Experimental results are included to show that this method can approximate large scale scattered data sets quickly

Published in:

Computer Graphics and Applications, 1998. Pacific Graphics '98. Sixth Pacific Conference on

Date of Conference:

26-29 Oct 1998