首页> 外文期刊>IEEE transactions on visualization and computer graphics >Lattice Cleaving: A Multimaterial Tetrahedral Meshing Algorithm with Guarantees
【24h】

Lattice Cleaving: A Multimaterial Tetrahedral Meshing Algorithm with Guarantees

机译:晶格分裂:具有保证的多材料四面体网格划分算法

获取原文
获取原文并翻译 | 示例

摘要

We introduce a new algorithm for generating tetrahedral meshes that conform to physical boundaries in volumetric domains consisting of multiple materials. The proposed method allows for an arbitrary number of materials, produces high-quality tetrahedral meshes with upper and lower bounds on dihedral angles, and guarantees geometric fidelity. Moreover, the method is combinatoric so its implementation enables rapid mesh construction. These meshes are structured in a way that also allows grading, to reduce element counts in regions of homogeneity. Additionally, we provide proofs showing that both element quality and geometric fidelity are bounded using this approach.
机译:我们引入了一种新算法,用于生成符合由多种材料组成的体积域中的物理边界的四面体网格。所提出的方法允许使用任意数量的材料,生成在二面角上具有上下边界的高质量四面体网格,并保证几何保真度。此外,该方法是组合式的,因此其实现可以快速构建网格。这些网格的结构还允许渐变,以减少同质区域中的元素数。此外,我们提供的证据表明,使用此方法可同时限制元素质量和几何保真度。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号