scholarly journals Surface Mesh Normals Filter

2008 ◽  
Author(s):  
Arnaud Gelas ◽  
Alexandre Gouaillard ◽  
Sean Megason
Keyword(s):  
Data Structure ◽  
Surface Mesh ◽  
Triangular Surface Mesh

We have previously developed a new surface mesh data structure in itk (~). In this document we describe a new filter () to estimate normals for a given triangular surface mesh in this data structure. Here we describe the implementation and use of this filter for calculating normals of a .

scholarly journals An Approach to Improving Triangular Surface Mesh

2005 ◽  
Vol 48 (2) ◽  
pp. 137-148 ◽  
Author(s):  
Maria SAVCHENKO ◽  
Olga EGOROVA ◽  
Ichiro HAGIWARA ◽  
Vladimir SAVCHENKO
Keyword(s):  
Surface Mesh ◽  
Triangular Surface Mesh

scholarly journals Surface Mesh Discrete Curvature Estimators

2008 ◽  
Author(s):  
Arnaud Gelas ◽  
Alexandre Gouaillard ◽  
Sean Megason
Keyword(s):  
Data Structure ◽  
Shape Analysis ◽  
Smooth Surface ◽  
Surface Mesh ◽  
Surface Evolution ◽  
Discrete Curvature ◽  
Analytical Expression ◽  
Surface Segmentation

Computing local curvatures of a given surface is important for applications, shape analysis, surface segmentation, meshing, and surface evolution. For a given smooth surface (with a given analytical expression which is sufficiently differentiable) curvatures can be analytically and directly computed. However in real applications, one often deals with a surface mesh which is an insufficiently differentiable approximation, and thus curvatures must be estimated. Based on a surface mesh data structure (~), we introduce and implement curvature estimators following the approach of Meyer. We show on a sphere that this method results in more stable curvature approximations than the commonly used discrete estimators (as used in VTK: ).

scholarly journals Methods for anchoring boundary nodes when smoothing a triangular surface mesh

2021 ◽  
Vol 12 (2) ◽  
pp. 207-219
Author(s):  
Sergei Sergeevich Shumilin
Keyword(s):  
Numerical Modeling ◽  
Surface Mesh ◽  
3D Surface ◽  
Smoothing Process ◽  
Surface Meshes ◽  
Triangular Surface Mesh

In numerical modeling tasks that use surface meshes, remeshing is often required. However, while remeshing, distortion can occur. The accumulation of distortions can lead to the collapse of the solution. Smoothing algorithms are used to maintain the quality of the mesh during the calculation. When performing smoothing using methods that shift the mesh nodes, the border nodes are usually fixed to avoid distortion. However, simply fixing the nodes can lead to more severe distortion. This paper presents methods for working with boundary nodes to control such nodes during the smoothing process. Algorithms for working with pseudo-3D surface meshes, which are of particular interest, are also considered.

scholarly journals Surface Meshes Incremental Decimation Framework

2008 ◽  
Author(s):  
Arnaud Gelas ◽  
Alexandre Gouaillard ◽  
Sean Megason
Keyword(s):  
Data Structure ◽  
General Framework ◽  
Computational Time ◽  
Surface Mesh ◽  
Surface Meshes ◽  
Mesh Decimation ◽  
Vertex Removal ◽  
Edge Collapse

When dealing with meshes, it is often preferable to work with a lower resolution mesh for computational time purpose, display. The process of reducing a given mesh, mesh decimation, is thus an important step in most of pipeline dealing with meshes. Incremental decimation algorithms, the most popular ones, consists of iteratively removing one point of the mesh, by Euler operations such as vertex removal or edge collapse. Here we focus on edge collapse based decimation approaches and propose a general framework based on a surface mesh data structure (itk::QuadEdgeMesh [3]). Our implementation intends to be as general and as flexible as possible. Indeed it can theoretically be applied on any polygonal mesh1; the measure, functional to be optimized at each iteration, the objective to be reached, and optional methods like point relocation to enhance the geometry of the resulting mesh, are given by the user. We provide here two specific implementations: itk::QuadEdgeMeshSquaredEdgeLengthDecimation and itk::QuadEdgeMeshQuadricDecimation, that could be used as example to implement additional algorithms.

Finite triangular surface mesh simplification with geometrical feature recognition

2009 ◽  
Vol 223 (11) ◽  
pp. 2627-2636 ◽  
Author(s):  
Y Zhang ◽  
H Wang ◽  
H Zhou ◽  
J Li
Keyword(s):  
Feature Recognition ◽  
Injection Pressure ◽  
Fem Analysis ◽  
Mesh Simplification ◽  
Surface Mesh ◽  
Mesh Quality ◽  
Large Curvature ◽  
Geometrical Feature ◽  
Aspect Ratios ◽  
Triangular Surface Mesh

The quantity and quality of the mesh elements are both significant factors for guaranteeing computational precision in the finite-element method (FEM). In most mesh simplification algorithms, the geometric error was thought to be the most important issue. However, the mesh quality was rarely taken into consideration. In this article, a finite triangular surface mesh simplification algorithm is proposed, in which the vertex dispersion is introduced to represent the local geometrical feature, and then either edge collapse or face collapse is carried out consequently. The aspect of the newly created face is taken into account and the position of the newly created vertex is obtained by solving an over-determined system of linear equations with respect to the aspect ratios of the newly created faces; thereupon the simplified mesh quality is improved. To obtain a further simplification and to reduce the errors in the succeeding FEM analysis, surface fitting is adopted on the surfaces with large curvature. Simplification cases had been performed in comparison with the quadric error metric method, and the results show that the definition of the local mesh density is more reasonable for the FEM analysis with the same simplification ratio while the present simplification algorithm is employed. Moreover, the mesh quality can be greatly improved on the surface with large curvature. A set of FEM numerical experiments of polymer injection moulding simulation had also been performed to determine the effect of the presented simplification algorithm on the FEM analysis. The numerical results show that the error of the injection pressure can be limited within 4 per cent, while the simplification percentage reaches 75 per cent.

scholarly journals Methods for anchoring boundary nodes when smoothing a triangular surface mesh

2021 ◽  
Vol 12 (2) ◽  
pp. 193-206
Author(s):  
Сергей Сергеевич Шумилин
Keyword(s):  
Surface Mesh ◽  
Triangular Surface Mesh

В задачах численного моделирования, использующих поверхностные сетки, часто требуется перестроение сетки. Однако при перестроении сетки могут возникать искажения. Накопление искажений может привести к развалу решения. Для того, чтобы поддерживать качество сетки в процессе расчета, применяются алгоритмы сглаживания. При выполнении сглаживания методами, сдвигающими узлы сетки, граничные узлы обычно закрепляют, чтобы избежать искажений. Однако простое закрепление узлов может привести к более серьезным искажениям. В данной работе предлагаются методы работы с граничными узлами, позволяющие контролировать такие узлы в процессе сглаживания. Также рассмотрены алгоритмы для работы с псевдотрехмерными поверхностными сетками, представляющими отдельный интерес.

Sign in / Sign up

Export Citation Format

Share Document