.png){kind=icon}
返回
All-quad meshing without cleanup
.png){kind=icon}
OA
AI
DOI：10.1016/j.cad.2016.07.009.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present an all-quad meshing algorithm for general domains. We start with a strongly balanced quadtree. In contrast to snapping the quadtree corners onto the geometric domain boundaries, we move them away from the geometry. Then we intersect the moved grid with the geometry. The resulting polygons are converted into quads with midpoint subdivision. Moving away avoids creating any flat angles, either at a quadtree corner or at a geometry-quadtree intersection. We are able to handle twosided domains, and more complex topologies than prior methods. The algorithm is provably correct and robust in practice. It is cleanup-free, meaning we have angle and edge length bounds without the use of any pillowing, swapping, or smoothing. Thus, our simple algorithm is fast and predictable. This paper has better quality bounds, and the algorithm is demonstrated over more complex domains, than our prior version. (C) 2016 Elsevier Ltd. All rights reserved.
Keyword:
All-quadrilateral meshing
Guaranteed quality
Sharp features
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.1
论文数:
3.1K
被引数:
6.4K
机构
引用论文
.png){kind=icon}
Hexagon-based all-quadrilateral mesh generation with guaranteed angle bounds具有保证角度边界的基于六边形的全四边形网格生成
PREAI
分享收藏分享收藏分享收藏Matching interior and exterior all-quadrilateral meshes with guaranteed angle bounds具有保证角度边界的匹配内部和外部全四边形网格
PREAI
分享收藏
查看更多内容