.png){kind=icon}
返回
VoroCrust: Voronoi Meshing Without Clipping
.png){kind=icon}
OA
AI
DOI：10.1145/3337680.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Polyhedral meshes are increasingly becoming an attractive option with particular advantages over traditional meshes for certain applications. What has been missing is a robust polyhedral meshing algorithm that can handle broad classes of domains exhibiting arbitrarily curved boundaries and sharp features. In addition, the power of primal-dual mesh pairs, exemplified by Voronoi-Delaunay meshes, has been recognized as an important ingredient in numerous formulations. The VoroCrust algorithm is the first provably correct algorithm for conforming polyhedral Voronoi meshing for non-convex and non-manifold domains with guarantees on the quality of both surface and volume elements. A robust refinement process estimates a suitable sizing field that enables the careful placement of Voronoi seeds across the surface, circumventing the need for clipping and avoiding its many drawbacks. The algorithm has the flexibility of filling the interior by either structured or random samples while preserving all sharp features in the output mesh. We demonstrate the capabilities of the algorithm on a variety of models and compare against state-of-the-art polyhedral meshing methods based on clipped Voronoi cells establishing the clear advantage of VoroCrust output.
Keyword:
Voronoi
meshing
refinement
sharp features
union of balls
Poisson-disk sampling
slivers
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.5
论文数:
4.7K
被引数:
3.6W
机构
引用论文
.png){kind=icon}
Interleaving Delaunay Refinement and Optimization for Practical Isotropic Tetrahedron Mesh Generation实用各向同性四面体网格生成的交错Delaunay细化和优化OAAI
OAAI分享收藏
查看更多内容