Ray-driven dynamic working set rendering

Ray tracing a volume scene graph composed of multiple point-based volume objects (PBVO) can produce high quality images with effects such as shadows and constructive operations. A naive approach, however, would demand an overwhelming amount of memory to accommodate all point datasets and their associated control structures such as octrees. This paper describes an out-of-core approach for rendering such a scene graph in a scalable manner. In order to address the difficulty in pre-determining the order of data caching, we introduce a technique based on a dynamic, in-core working set. We present a ray-driven algorithm for predicting the working set automatically. This allows both the data and the control structures required for ray tracing to be dynamically pre-fetched according to access patterns determined based on captured knowledge of ray-data intersection. We have conducted a series of experiments on the scalability of the technique using working sets and datasets of different sizes. With the aid of both qualitative and quantitative analysis, we demonstrate that this approach allows the rendering of multiple large PBVOs in a volume scene graph to be performed on desktop computers.     

Reconstruction of 3D Object Meshes from Silhouette Images

In this work we propose a method for computing mesh representations of 3D objects reconstructed from a set of silhouette images. Our method is based on the polygonization of volumetric reconstructions by using a modified version of the dual contouring method. In order to apply dual contouring on volumetric reconstruction from silhouettes we devised a method that is able to determine the discrete topology of the surface in relation to the octree cells. We also developed a new scheme for computing hermitian data representing the intersections of conic volumes with the octree cells and their corresponding normals with subpixel accuracy. Due to the discrete and extremely noisy nature of the data used in the reconstruction we had to devise a different criterion for mesh simplification that applies topological consistency tests only when the geometric error measure is beyond a given tolerance. We present results of the application of the proposed method in the extraction of a mesh corresponding to the surface of objects of a real scene.     

基于Shear-warp的交互式海量数据场体绘制算法

提出了基于min-max Octree快速分类Shear-warp的交互式海量数据场体绘制算法.主要包括根据海量数据的特征,快速读入数据以及设计适当的不透明度传递函数;建立Summed-Area表与min-max Octree数据结构,并对体数据进行快速分类,然后,利用分类的结果进行快速体绘制.实验证明该方法不仅效率高,而且显示效果好.     

八叉树矿体块状模型及其在三道庄露天矿的应用

矿体块状模型广泛应用于品位、储量计算,也可用于露天矿最终开采境界优化和开采计划优化。在研究了八叉树存储结构和基于分离轴的OBB相交测试理论的基础上,提出首先应用八叉树对矿体三维空间进行块状划分,将矿体用一系列的小单元块来逼近,然后利用OBB理论检测单元块与矿体边界的空间关系,对相交单元块进行细分,利用点在多面体内外判断确保块状模型约束在表面模型内,从而以最佳状态逼近矿体边界。最后运用该方法建立了三道庄露天矿矿体块状模型。该方法快速有效,能够满足矿山生产设计需求。     

一种快速的三维有限元网格生成方法

针对三维有限元网格的生成的速度较慢并且网格质量不高的问题,提出了一种基于约束波前法的三维有限元网格生成算法。算法的主要思想是用背景网格提高网格单元的可控性,避免网格单元生成时验证有效性的计算量,从而快速生成高质量的三维有限元网格。算法首先借助八叉树方法生成背景网格,其次利用背景网格的密度对模型表面进行三角剖分得到初始波前,然后依据背景网格的特征生成实体网格单元,最后对得到的结果进行优化。实验证明结合了八叉树和推进波前法的三维网格生成算法降低了波前法的时间复杂度,将其效率提高了20%,而且能得到更高质量的网格。     

基于建立3DGIS的八叉树压缩算法的研究与改进

在3DGIS领域中,空间数据结构占有突出的地位,它直接关系到GIS的功能和效率。为了对3DGIS海量数据进行有效地存储和管理,本文讨论了3DGIS栅格数据结构线性八叉树编码压缩技术,并在原来压缩技术基础上,对其压缩过程进行了改进,同时给出了改进后的压缩和解压缩算法。通过对改进前后算法的比较,发现改进后的算法在压缩时间和数据压缩率上都有显著提高。     

一种使用八叉树存储三角网格图元的算法

八叉树是三维数据建模中应用较为广泛的数据结构．本文提出使用八叉树来存储三角网格中的点、线、面等图元。实验证明,使用该数据结构能够提高访问图元的速度。     

一种基于八叉树的地质体三维网格剖分方法

提出了一种地质体三维四面体网格的剖分方法。该法以八叉树法为基础,采用正四面体包围盒代替传统的六面体包围实体,进行八叉树剖分,直接形成比较规则的四面体网格,然后利用常见矿业软件生成的表面模型对四面体网格进行实体边界的恢复。此时,边界处的网格单元往往分布不均匀,质量不理想,并且存在一些薄元,需要优化和消除,以形成有限元分析所需的高质量四面体网格。     

树型结构预处理算法及在游戏引擎中的实现

经过分析和验证，以八叉树碰撞节点生成为例，采用文件一次性记录划分结果，并在渲染时从文件读取，有效的缩短了生成八叉树的时间。此项设计也是游戏引擎中的一个功能模块。     

大规模战场电磁环境并行体绘制技术研究

提出了一种基于PC集群的大规模三维战场电磁环境并行绘制方法。该方法采用直接体绘制的三维体数据可视化方法;利用空间八叉树对电磁绘制区间进行空间分割,并采用先序遍历八叉树叶节点的方式进行任务分配;采用Binary-swap算法对各PC节点的生成图像逐次进行全屏幕深度合成。实验表明,该方法能够较好满足大规模战场电磁环境实时可视化的要求。