We describe a new method for surface reconstruction based on unorganized point clouds without normals. We also present a new algorithm for refining the inital triangulation. The output of the method is a refined triangular mesh with points on the moving least squares surface of the original point cloud.

We introduce moving least squares approximation as an approximation scheme on the sphere. We prove error estimates and approximation orders. Finally, we show certain numerical results. x1. Introduction Recently, approximation on the sphere has become important because of its obvious applications to Meteorology, Oceanography and Geoscience and Geo-engineering in general. Over the last years seve...

The paper shows that the SPH boundary handling of Akinci et al. [AIA∗12] suffers from perceivable issues in planar regions due to deviations in the computed boundary normals and due to erroneous oscillations in the distance computation of fluid particles to the boundary. In order to resolve these issues, we propose a novel boundary handling that combines the SPH concept with Moving Least Square...

We present a 3d deformation method based on Moving Least Squares that extends the work by Schaefer et al. [Schaefer et al. 2006] to the 3d setting. The user controls the deformation by manipulating a set of point handles. Locally, the deformation takes the form of either a rigid transformation or optionally a similarity transformation, and tends to preserve local features. Our derivation of the...

Modern simulation and measurement methods tend to produce meshfree data sets if modeling of processes or objects with free surfaces or boundaries is desired. In Computational Fluid Dynamics (CFD), such data sets are described by particle-based vector fields. This paper presents a summary of a selection of methods for the extraction of geometric features of such point-based vector fields while p...

A general method for near-best approximations to functionals on Rd, using scattered-data information is discussed. The method is actually the moving least-squares method, presented by the Backus-Gilbert approach. It is shown that the method works very well for interpolation, smoothing and derivatives’ approximations. For the interpolation problem this approach gives Mclain’s method. The method ...

In this paper, we analyze the weight functions used in implicit moving least squares (IMLS) methods to construct implicit surfaces that interpolate or approximate polygon soup. We found that one method that presented an analytic solution to the integrated moving least squares method has issues with degeneracies because they changed the weight functions to decrease too slowly. We derive bounds f...

soil conservation service (scs) adjusted the kostiakovs infiltration model by adding a constant coefficient, for improvement of estimation. the improved model has three constant parameters, which are difficult to calculate. so scs has taken the third constant parameter as equal to 0.65-0.7 cm to simplify the estimation. this parameter varies in different soil and often outranges the scs estimat...

By combining the well known moving least squares approximation method and the theory of approximate approximations due to Maz’ya and Schmidt we are able to present an approximate moving least squares method which inherits the simplicity of Shepard’s method along with the accuracy of higher-order moving least squares approximations. In this paper we focus our interest on practical implementation...