Results 21 to 30 of about 128,865 (293)
Encoding Conversion Algorithm of Quaternary Triangular Mesh
In the process of global information construction, different fields have built their own discrete global grid systems (DGGS). With the development of big data technology, data exchange, integration, and update have gradually become a trend, as well as ...
Yihang Chen +4 more
doaj +1 more source
On the resolution of triangular meshes
AbstractIt is generally agreed that the resolution of a regular quadrilateral mesh is the side length of quadrilateral cells. There is less agreement on the resolution of triangular meshes, exacerbated by the fact that the numbers of edges or cells on triangular meshes are approximately three or two times larger than that of vertices.
openaire +2 more sources
Adaptive triangular-quadrilateral mesh generation [PDF]
The authors propose an automatic triangular to quadrilateral mesh conversion adaption scheme and introduce a new optimal vertex smoothing procedure. Some numerical results, academic tests and a computational fluid dynamics example show the efficiency of the proposed method.
Borouchaki, Houman, Frey, Pascal J.
openaire +2 more sources
Repair of Voids in Multi-Labeled Triangular Mesh
In this paper, we propose a novel mesh repairing method for repairing voids from several meshes to ensure a desired topological correctness. The input to our method is several closed and manifold meshes without labels.
Deyun Zhong +5 more
doaj +1 more source
Adaptive Semi-Structured Mesh Refinement Techniques for the Finite Element Method
The adaptive mesh techniques applied to the Finite Element Method have continuously been an active research line. However, these techniques are usually applied to tetrahedra. Here, we use the triangular prismatic element as the discretization shape for a
Adrian Amor-Martin +1 more
doaj +1 more source
Thin discrete triangular meshes
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Barneva, Reneta P. +2 more
openaire +1 more source
In this paper, we present a novel surface mesh generation approach that splits B-rep geometry models into isotropic triangular meshes based on neural networks and splitting lines.
Zengsheng Liu +6 more
doaj +1 more source
Computing geodesics on triangular meshes [PDF]
We present a new algorithm to compute a geodesic path over a triangulated surface. Based on Sethian's Fast Marching Method and Polthier's straightest geodesics theory, we are able to generate an iterative process to obtain a good discrete geodesic approximation. It can handle both convex and non-convex surfaces.
Dimas MartĂnez +2 more
openaire +1 more source
New approaches for Delaunay triangulation and optimisation
New techniques are presented for Delaunay triangular mesh generation and element optimisation. Sample points for triangulation are generated through mapping (a new approach). These sample points are later triangulated by the conventional Delaunay method.
Logah Perumal
doaj +1 more source
The box-counting dimension, which can effectively reflect the complexity and self-similarity of models, is an important method for calculating the fractal dimension of models.
Chong Wang, Weiqiang An
doaj +1 more source

