首页> 外文会议>Conference on Visualization >Efficient subdivision of finite-element datasets into consistent tetrahedra
【24h】

Efficient subdivision of finite-element datasets into consistent tetrahedra

机译:有限元数据集的高效细分成一致的四面体

获取原文

摘要

The paper discusses the problem of subdividing unstructured mesh topologies containing hexahedra, prisms, pyramids and tetrahedra into a consistent set of only tetrahedra, while preserving the overall mesh topology. Efficient algorithms for volume rendering, iso-contouring and particle advection exist for mesh topologies comprised solely of tetrahedra. General finite-element simulations however, consist mainly of hexahedra, and possibly prisms, pyramids and tetrahedra. Arbitrary subdivision of these mesh topologies into tetrahedra can lead to discontinuous behaviour across element faces. This will show up as visible artifacts in the iso-contouring and volume rendering algorithms, and lead to impossible face adjacency graphs for many algorithms. The authors present various properties of tetrahedral subdivisions, and an algorithm SOP determining a consistent subdivision containing a minimal set of tetrahedra.
机译:本文讨论了将含HepaWEDRA,棱镜,金字塔和四面体的非结构化网眼拓扑分成一组仅限于四面体的问题,同时保留了整体网格拓扑。仅存在仅由四面体组成的网状拓扑体的体积渲染,异构型和粒子平流的高效算法。然而,一般有限元模拟主要由Hexahedra和可能的棱镜,金字塔和四面体组成。这些网状拓扑到四面体的任意细分可能导致元素面的不连续行为。这将在ISO轮廓和体积渲染算法中显示出可见伪像,并导致许多算法的不可能的面邻接图。作者呈现了四面体细分的各种性质,以及确定包含最小一组四面体的一致细分的算法SOP。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号