Error Bounds and Optimal Neighborhoods for MLS Approximation

Lipman, Yaron; Cohen-Or, Daniel; Levin, David

Error Bounds and Optimal Neighborhoods for MLS Approximation

Files

071-080.pdf (4.2 MB)

Date

2006

Authors

Lipman, Yaron
Cohen-Or, Daniel
Levin, David

Publisher

The Eurographics Association

Abstract

In recent years, the moving least-square (MLS) method has been extensively studied for approximation and reconstruction of surfaces. The MLS method involves local weighted least-squares polynomial approximations, using a fast decaying weight function. The local approximating polynomial may be used for approximating the underlying function or its derivatives. In this paper we consider locally supported weight functions, and we address the problem of the optimal choice of the support size. We introduce an error formula for the MLS approximation process which leads us to developing two tools: One is a tight error bound independent of the data. The second is a data dependent approximation to the error function of the MLS approximation. Furthermore, we provide a generalization to the above in the presence of noise. Based on the above bounds, we develop an algorithm to select an optimal support size of the weight function for the MLS procedure. Several applications such as differential quantities estimation and up-sampling of point clouds are presented. We demonstrate by experiments that our approach outperforms the heuristic choice of support size in approximation quality and stabilit

        @inproceedings{:10.2312/SGP/SGP06/071-080
,
booktitle = {Symposium on Geometry Processing
},
editor = {Alla Sheffer and Konrad Polthier
},
title = {{Error Bounds and Optimal Neighborhoods for MLS Approximation
}},
author = {Lipman, Yaron and 
Cohen-Or, Daniel and 
Levin, David
},
year = {2006
},
publisher = {The Eurographics Association
},
ISSN = {1727-8384
},
ISBN = {3-905673-24-X
},
DOI = {/10.2312/SGP/SGP06/071-080
}
}