Results 1 to 10 of about 1,741,379 (297)
Mesh smoothing algorithm based on exterior angles split. [PDF]
Since meshes of poor quality give rise to low accuracy in finite element analysis and kinds of inconveniences in many other applications, mesh smoothing is widely used as an essential technique for the improvement of mesh quality.
Yongqing Hai +3 more
doaj +3 more sources
Non-Iterative, Feature-Preserving Mesh Smoothing [PDF]
With the increasing use of geometry scanners to create 3D models, there is a rising need for fast and robust mesh smoothing to remove inevitable noise in the measurements.
ALEXA M. +17 more
core +8 more sources
Designing Parallel Adaptive Laplacian Smoothing for Improving Tetrahedral Mesh Quality on the GPU
Mesh quality is a critical issue in numerical computing because it directly impacts both computational efficiency and accuracy. Tetrahedral meshes are widely used in various engineering and science applications.
Ning Xi, Yingjie Sun, Lei Xiao, Gang Mei
doaj +2 more sources
Optimal Point Placement for Mesh Smoothing [PDF]
We study the problem of moving a vertex in an unstructured mesh of triangular, quadrilateral, or tetrahedral elements to optimize the shapes of adjacent elements.
Adler +33 more
core +4 more sources
Tetrahedral mesh improvement using moving mesh smoothing, lazy searching flips, and RBF surface reconstruction [PDF]
Given a tetrahedral mesh and objective functionals measuring the mesh quality which take into account the shape, size, and orientation of the mesh elements, our aim is to improve the mesh quality as much as possible.
Dassi, Franco +3 more
core +5 more sources
Locality-Aware Laplacian Mesh Smoothing [PDF]
In this paper, we propose a novel reordering scheme to improve the performance of a Laplacian Mesh Smoothing (LMS). While the Laplacian smoothing algorithm is well optimized and studied, we show how a simple reordering of the vertices of the mesh can ...
G. Aupy, Jeonghyung Park, P. Raghavan
semanticscholar +4 more sources
Order-Randomized Laplacian Mesh Smoothing [PDF]
In this paper we compare three variants of the graph Laplacian smoothing. The first is the standard synchronous implementation, corresponding to multiplication by the graph Laplacian matrix. The second is a voter process inspired asynchronous implementation, assuming that every vertex is equipped with an independent exponential clock.
Ying Yang, H. Rushmeier, I. Ivrissimtzis
semanticscholar +3 more sources
Quality improvement of surface triangular mesh using a modified Laplacian smoothing approach avoiding intersection. [PDF]
We present a systematic procedure to improve the qualities of triangular molecular surface meshes and at the same time preserve the manifoldness. The procedure utilizes an algorithm to remove redundant points having three or four valences and another ...
Tiantian Liu +4 more
doaj +2 more sources
Tetrahedral mesh improvement using moving mesh smoothing and lazy searching flips
We combine the new moving mesh smoothing , based on the integration of an ordinary differential equation coming from a given functional, with the new lazy flip technique, a reversible edge removal algorithm for local mesh quality improvement.
F. Dassi, L. Kamenski, H. Si
semanticscholar +6 more sources
Interactive toon shading using mesh smoothing [PDF]
Toon shading mimics the style of few colour bands and hence offers an effective way to convey the cartoon-style rendering. Despite an increasing amount of research on toon shading, little research has been reported on generation of toon shading style ...
Al-Rousan, R +2 more
core +2 more sources

