An adaptive method for smooth surface approximation to scattered 3D points

被引:34
作者
Park, H
Kim, K
机构
[1] Department of Industrial Engineering, Pohang University of Science and Technology, Pohang
关键词
algorithms; geometric modelling; surface approximation; data compression; triangular Bezier patches; constrained Delaunay triangulation;
D O I
10.1016/0010-4485(95)00006-2
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
The construction of a surface from arbitrarily scattered data is an important problem in many applications. When there are a large number of data points, the surface representations generated by interpolation methods may be inefficient in both storage and computational requirements. This paper describes an adaptive method for smooth surface approximation from scattered 3D points. The approximating surface is represented by a piecewise cubic triangular Bezier surface possessing C-1 continuity. The method begins with a rough surface interpolating only boundary points and, in the successive steps, refines it by adding the maximum error point at a time among the remaining internal points until the desired approximation accuracy is reached. Our method is simple in concept and efficient in computational time, yet realizes efficient data reduction. Some experimental results are given to show that surface representations constructed by our method are compact and faithful to the original data points.
引用
收藏
页码:929 / 939
页数:11
相关论文
共 23 条