一种用于嵌入自相交曲面的稳健的基于网格的网格化算法
A Robust Grid-Based Meshing Algorithm for Embedding Self-Intersecting Surfaces
AI总结:
提出一种从自相交输入三角网格生成体积嵌入六面体网格的稳健算法,通过均匀背景网格与拓扑感知粗化技术高效处理自相交,并支持用户指定分辨率及四面体化。
摘要:
创建表示输入多边形网格内部的体积网格是图形学和计算力学应用中的常见需求。大多数网格创建技术假设输入曲面不是自相交的。然而,由于数值和/或用户错误,输入曲面通常存在某种程度的自相交。消除自相交是一项繁重的任务,它使工作流程复杂化,并且通常会减慢创建可用于仿真的数字资产的过程。我们提出了一种从自相交的输入三角网格创建体积嵌入六面体网格的方法。我们的方法旨在通过最小化计算代价昂贵的精确/自适应精度算术的使用来提高效率。尽管我们的方法对输入曲面中自相交的程度几乎没有限制,但我们的重点是最常见情况下的效率:许多微小的自相交。嵌入六面体网格由均匀背景网格创建,并由几何上是网格单元副本的六面体单元组成。单个网格单元的多个副本被用于解决自相交/重叠区域。最后,我们开发了一种新颖的拓扑感知嵌入网格粗化技术,以允许用户指定的网格分辨率,以及六面体网格的拓扑感知四面体化。
英文摘要:
The creation of a volumetric mesh representing the interior of an input polygonal mesh is a common requirement in graphics and computational mechanics applications. Most mesh creation techniques assume that the input surface is not self-intersecting. However, due to numerical and/or user error, input surfaces are commonly self-intersecting to some degree. The removal of self-intersection is a burdensome task that complicates workflow and generally slows down the process of creating simulation-ready digital assets. We present a method for the creation of a volumetric embedding hexahedron mesh from a self-intersecting input triangle mesh. Our method is designed for efficiency by minimizing use of computationally expensive exact/adaptive precision arithmetic. Although our approach allows for nearly no limit on the degree of self-intersection in the input surface, our focus is on efficiency in the most common case: many minimal self-intersections. The embedding hexahedron mesh is created from a uniform background grid and consists of hexahedron elements that are geometrical copies of grid cells. Multiple copies of a single grid cell are used to resolve regions of self-intersection/overlap. Lastly, we develop a novel topology-aware embedding mesh coarsening technique to allow for user-specified mesh resolution as well as a topology-aware tetrahedralization of the hexahedron mesh.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。