Idioma:

Fast harmonic tetrahedral mesh optimization

Ströter, D. ; Mueller-Roemer, J. S. ; Weber, D. ; Fellner, D. W.

The Visual computer, 2022-09, Vol.38 (9-10), p.3419-3433 [Periódico revisado por pares]

Berlin/Heidelberg: Springer Berlin Heidelberg

Texto completo disponível

Citações Citado por

Enviar para

Título:
Fast harmonic tetrahedral mesh optimization
Autor: Ströter, D. ; Mueller-Roemer, J. S. ; Weber, D. ; Fellner, D. W.
Assuntos: Algorithms ; Artificial Intelligence ; Computer Graphics ; Computer Science ; Decomposition ; Energy ; Finite element method ; Geometric accuracy ; Image Processing and Computer Vision ; Mathematical analysis ; Numerical analysis ; Numerical methods ; Optimization ; Ordinary differential equations ; Original Article ; Relocation
É parte de: The Visual computer, 2022-09, Vol.38 (9-10), p.3419-3433
Descrição: Mesh optimization is essential to enable sufficient element quality for numerical methods such as the finite element method (FEM). Depending on the required accuracy and geometric detail, a mesh with many elements is necessary to resolve small-scale details. Sequential optimization of large meshes often imposes long run times. This is especially an issue for Delaunay-based methods. Recently, the notion of harmonic triangulations [ 1 ] was evaluated for tetrahedral meshes, revealing significantly faster run times than competing Delaunay-based methods. A crucial aspect for efficiency and high element quality is boundary treatment. We investigate directional derivatives for boundary treatment and massively parallel GPUs for mesh optimization. Parallel flipping achieves compelling speedups by up to 318 × . We accelerate harmonic mesh optimization by 119 × for boundary preservation and 78 × for moving every boundary vertex, while producing superior mesh quality.
Editor: Berlin/Heidelberg: Springer Berlin Heidelberg
Idioma: Inglês

Voltar para lista de resultados

Realização: Logos de Redes Sociais:

Fast harmonic tetrahedral mesh optimization

Ströter, D. ; Mueller-Roemer, J. S. ; Weber, D. ; Fellner, D. W.

Berlin/Heidelberg: Springer Berlin Heidelberg

Buscando em bases de dados remotas. Favor aguardar.