.png){kind=icon}
返回
Fast Quadtree/Octree adaptive meshing and re-meshing with linear mixed elements
.png){kind=icon}
PRE
AI
DOI：10.1007/s00366-021-01330-w.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we will focus on adaptive meshing and re-meshing. We present an original approach, based on Quadtree and Octree, to construct the initial mesh and refine it using mixed-elements. We propose a fast algorithm using a determined set of Patterns to handle transitions between fine and coarse regions, and to closely approximate surface boundaries. An optimized structure for storing edges permits to efficiently manage neighbor information, dramatically reducing the balancing time. Results, both in 2D and 3D, exhibit the multiple possibilities for local refinements. Comparisons in terms of accuracy, number of elements in the resulting mesh, and computation time, clearly position our method as a competitive alternative to generate a conform adapted mesh, which can be used with standard numerical methods.
Keyword:
Mesh reconstruction
Adaptive refinement
Mixed-element mesh
Balanced Quadtree
Octree
Edge data structure
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.9
论文数:
2.7K
被引数:
9.3K
机构
引用论文
.png){kind=icon}
A smoothed finite element method for octree-based polyhedral meshes with large number of hanging nodes and irregular elements具有大量悬挂节点和不规则单元的基于八叉树的多面体网格的光滑有限元方法
PREAI
分享收藏
分享收藏分享收藏
查看更多内容