Multilevel least squares approximation of scattered data over binary triangulations

被引：5

作者：

Hjelle, Oyvind ^{[1
]}

Daehlen, Morten ^{[1
]}

机构：

[1] Simula Res Lab, POB 134, N-1325 Lysaker, Norway

来源：

COMPUTING AND VISUALIZATION IN SCIENCE | 2005年 / 8卷 / 02期

关键词：

D O I：

10.1007/s00791-005-0154-7

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

An adaptive method for approximating huge scattered data sets is presented. The approximation scheme generates multilevel triangulations obtained using a subdivision scheme known as longest edge bisection. Nested function spaces are defined over the multilevel triangulations. The approximation problem is solved by successive refinement of the triangulation while iterative methods are used for solving a system of linear equations at intermediate levels of the multi-level scheme. Regularization terms are coupled with a standard least squares formulation to guarantee uniqueness and control smoothness of the solution.

引用

页码：83 / 91

页数：9

共 26 条

[21] ADAPTIVE APPROXIMATION BY PIECEWISE LINEAR POLYNOMIALS ON TRIANGULATIONS OF SUBSETS OF SCATTERED DATA [J].

RIPPA, S .

SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1992, 13 (05) :1123-1141

[22]

Rottger S, 1998, WSCG 98, VOL 2, P315

[23]

Shepard D., 1968, P 1968 23 ACM NAT C, P517, DOI DOI 10.1145/800186.810616

[24]

Unther Greiner G., 1997, INTERPOLATING APPROX, P163

[25] Variable resolution 4-k meshes:: Concepts and applications [J].

Velho, L ;

Gomes, J .

COMPUTER GRAPHICS FORUM, 2000, 19 (04) :195-212

[26]

VONGOLITSCHEK M, 1990, ALGORITHMS FOR APPROXIMATION II, P210

← 1 2 3 →