دورية أكاديمية
VoroCrust: Voronoi Meshing Without Clipping.
| العنوان: | VoroCrust: Voronoi Meshing Without Clipping. |
|---|---|
| المؤلفون: | Abdelkader A; University of Maryland, College Park., Bajaj CL; University of Texas, Austin., Ebeida MS; Sandia National Laboratories., Mahmoud AH; University of California, Davis., Mitchell SA; Sandia National Laboratories., Owens JD; University of California, Davis., Rushdi AA; University of California, Davis and Sandia National Laboratories. |
| المصدر: | ACM transactions on graphics [ACM Trans Graph] 2020 May; Vol. 39 (3). |
| نوع المنشور: | Journal Article |
| اللغة: | English |
| بيانات الدورية: | Publisher: Association for Computing Machinery Country of Publication: United States NLM ID: 101152234 Publication Model: Print Cited Medium: Print ISSN: 0730-0301 (Print) Linking ISSN: 07300301 NLM ISO Abbreviation: ACM Trans Graph Subsets: PubMed not MEDLINE |
| أسماء مطبوعة: | Original Publication: New York, N.Y. : Association for Computing Machinery, c1982- |
| مستخلص: | 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 arbitrary 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 Voronoi meshing for non-convex and possibly 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 all sharp features are preserved 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. |
| References: | J Comput Phys. 2007 Oct 1;226(2):1271-1290. (PMID: 18836520) Chaos. 2009 Dec;19(4):041111. (PMID: 20059195) Lebniz Int Proc Inform. 2018 Jun;99:. (PMID: 30687412) |
| معلومات مُعتمدة: | R01 GM117594 United States GM NIGMS NIH HHS |
| فهرسة مساهمة: | Keywords: Meshing; Poisson-disk Sampling; Refinement; Sharp Features; Slivers; Union of Balls; Voronoi |
| تواريخ الأحداث: | Date Created: 20200825 Latest Revision: 20200826 |
| رمز التحديث: | 20240628 |
| مُعرف محوري في PubMed: | PMC7439975 |
| DOI: | 10.1145/3337680 |
| PMID: | 32831464 |
| قاعدة البيانات: | MEDLINE |
| تدمد: | 0730-0301 |
|---|---|
| DOI: | 10.1145/3337680 |