Smooth approximation and rendering of large scattered data sets
Proceedings of the conference on Visualization '01
| Hi-index | 0.00 |
In this paper, 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, refinement process is only located in the regions where the error between the scattered data and the result surface is greater than a specified error. A recursive algorithm is used to find these regions. In order to ensure the c2-continuity of the resulted surfaces, we introduce an additional method to get the boundary control points around the sub-control-lattice. Experimental results are included to show that this method can approximate large scale scattered data set quickly.