Cell projection of convex polyhedra
Cell projection of convex polyhedra
复制标题
凸多面体的单元投影
DOI：
10.1145/827051.827067
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
T. Ertl
中科院分区：
文献类型：
--
作者：
S. Röttger;T. Ertl
有限元方法通常使用非结构网格作为计算域。事实上，这些非结构化网格的体可视化是一项耗时的任务。在这里，已知最快的对象排序算法是Shirley和Tuchman的投影四面体算法。即使随着可编程图形硬件的出现，渲染性能也没有跟上日益复杂的仿真数据。在本文中，我们努力提高性能的细胞投影技术的光学模型提出了几个限制。这使我们能够设计一个简单而快速的硬件加速算法，它能够投影任意多面体细胞，也就是四面体，棱柱体，六面体等，出于这个原因，我们的算法是非常适合于显示非结构化有限元网格与混合细胞类型，但它也适用于实时显示的气体phenonema，如火和地面雾。
Finite element methods commonly use unstructured grids as the computational domain. As a matter of fact, the volume visualization of these unstructured grids is a time consuming task. Here, the fastest known object order algorithm is the projected tetrahedra algorithm of Shirley and Tuchman. Even with the upcoming of programmable graphics hardware, the rendering performance did not keep up with the growing complexity of the simulation data. In this paper we strive to improve the performance of the cell projection technique by posing several restrictions on the optical model. This allows us to devise a simple but fast hardware-accelerated algorithm which is able to project arbitrary polyhedral cells, that is tetrahedra, prisms, hexahedra, etc. For this reason, our algorithm is well suited for the display of unstructured FEM meshes with mixed cell types, but it is also applicable to the real-time display of gaseous phenonema, such as fire and ground fog.