نتایج جستجو برای: moving least squares mls
تعداد نتایج: 496082 فیلتر نتایج به سال:
Point sets from range scanners are noisy and do not contain additional data such as normals, which makes it difficult to create a mesh for rendering. We use the moving least-squares (MLS) approximation to get normals and differential information, and approximate the surface near each point by an MLS surface. From this we obtain a splat of a new octagonal shape which approximates the local curva...
This paper studies the convergence properties of an arbitrary Lagrangian–Eulerian (ALE) Riemann-based SPH algorithm in conjunction with a Weighted Essentially Non-Oscillatory (WENO) high-order spatial reconstruction, framework DualSPHysics open-source code. A analysis is carried out for Lagrangian and Eulerian simulations numerical results demonstrate that, absence particle disorder, overall sc...
CFD has become more and more used in the industry for the simulation of flows. Nevertheless, the complex configurations of real engineering problems make difficult the application of very accurate methods that only works on structured grids. From this point of view, the development of higher order methods for unstructured grids is desirable. The finite volume method can be used with unstructure...
Detail-preserving deformations of two-dimensional shapes have recently received wide attention in the field of computer graphics. Among them, the deformation method using Moving Least-Squares (MLS) proved to produce smooth deformations with low computational costs. However, it suffers from artifacts due to the ignorance of the topological structure of the shape. This paper presents a novel algo...
In recent years, Lagrangian Coherent Structures (LCS) have been characterized using the Finite-Time Lyapunov Exponent, following the advection of a dense set of particles into a corresponding flow field. The large amount of particles needed to sufficiently map a flow field has been a non-trivial computational burden in the application of LCS. By seeding a minimal amount of particles into the fl...
We present a novel algorithm for the geometric extraction of stream volume segmentation for visualization of grid-less flow simulation. Our goal is the segmentation of different paths through a mixing tube where the flow is represented by scattered point sets approximated with moving least squares. The key challenges are the watertight construction of boundary representations from separatrices....
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید