一种基于自然数线性八叉树的优化构造算法

本文提出了一种基于自然数线性八叉树的优化构造算法。该算法以活动结点表为中间辅助结构，在图像输入过程中直接生成基于Ｎ码的八叉树叶结点．与常规构造算法相比，新提出的优化构造算法省去了Ｎ码的计算及合并过程，从而具有较高的时空效率．     

Path planning in complex 3D environments using a probabilistic roadmap method

This paper presents a 3D path planning algorithm for an unmanned aerial vehicle （UAV） in complex environments. In this algorithm, the environments are divided into voxels by octree algorithm. In order to satisfy the safety requirement of the UAV, free space is represented by free voxels, which have enough space margin for the UAV to pass through. A bounding box array is created in the whole 3D space to evaluate the free voxel connectivity. The probabilistic roadmap method （PRM） is improved by random sampling in the bounding box array to ensure a more efficient distribution of roadmap nodes in 3D space. According to the connectivity evaluation, the roadmap is used to plan a feasible path by using A＊ algorithm. Experimental results indicate that the proposed algorithm is valid in complex 3D environments.     

八叉树搜索算法在计算机辅助手术中的应用

讨论基于八叉树的空间搜索与求交算法,包括基于八叉树的单元格分配及求交运算2个步骤。该算法可有效应用于计算机辅助手术,实现解剖标志点的空间定位、距离测量、骨厚测量、三维模型间的干涉与距离检测等。其运算效率较高,具有良好的通用性和扩展性,适用于各类计算机辅助手术规划与手术导航软件。     

Surface mesh regeneration considering curvatures

This work describes an automatic algorithm for unstructured mesh regeneration on arbitrarily shaped three-dimensional surfaces. The arbitrary surface may be: a triangulated mesh, a set of points, or an analytical surface (such as a collection of NURBS patches). To be generic, the algorithm works directly in Cartesian coordinates, as opposed to generating the mesh in parametric space, which might not be available in all the cases. In addition, the algorithm requires the implementation of three generic functions that abstractly represent the supporting surface. The first, given a point location, returns the desired characteristic size of a triangular element at this position. The second method, given the current edge in the boundary-contraction algorithm, locates the ideal apex point that forms a triangle with this edge. And the third method, given a point in space and a projection direction, returns the closest point on the geometrical supporting surface. This work also describes the implementation of these three methods to re-mesh an existing triangulated mesh that might present regions of high curvature. In this implementation, the only information about the surface geometry is a set of triangles. In order to test the efficiency of the proposed algorithm of surface mesh generation and implementation of the three abstract methods, results of performance and quality of generated triangular element examples are presented.     

运用八叉树3D纹理实现CFD数据场的直接体绘制

基于3D纹理的直接体绘制算法可以在保证图像质量的同时达到较好的交互性能,但由于纹理内存的限制,大规模数据场的3D纹理直接体绘制比较困难。作者提出了一种适用于计算流体力学(ComputationalFluidDynamics,CFD)数据场的八叉树3D纹理分割算法。该算法首先对数据场进行层次分割,然后根据CFD数据场的四面体网格特点插值生成规则网格数据场,最后生成基于八叉树结点的3D纹理子块。试验证明该算法可以较好地实现CFD大规模数据场的直接体绘制,渲染速度基本达到交互性的要求,较好地体现数据场内部的层次与结构关系。     

基于线性八叉树的光线投射体绘制算法改进研究

体视化是地学信息三维可视化研究的前沿技术之一，体绘制算法的效率直接关系到体视化的效果。本文在研究已有光线投射体绘制改进算法的基础上，提出利用线性八叉树数据结构对光线投射体绘制算法进行改进研究，不仅实现了体数据的压缩。而且能对压缩体数据进行直接体视化。在PC机上的实验表明，该方法具有时间复杂度与数据复杂度基本无关的特点．加速效果明显。最后，文章指出了该方法的适用范围。     

LED立体显示器的设计

利用平面LED点阵高速旋转产生立体影像的原理,设计出立体显示系统的机械结构和硬件电路,并提出基于立体图形八叉树结构生成平面LED点阵的算法,利用此算法实现立体显示。显示的图像不需要借助其他设备可以从空间任意角度观看。     

基于点的绘制与压缩技术

基于点的模型数据往往非常庞大,因此怎样在有限的硬件环境下对庞大的点云数据进行压缩传输和实时绘制成为基于点的图形学中两个最重要的问题.回顾了基于点的绘制的最新研究进展,将基于点模型的压缩算法分为渐进压缩编码和单分辨率压缩编码两类分别进行介绍和分析比较,并给出了一些研究建议.     

一种高效的FE-PSBFE耦合方法及在岩土工程弹塑性分析中的应用

针对复杂岩土工程结构建模困难、耗时费力的难题,结合八叉树网格离散技术,对网格中的六面体采用等参单元,对于非六面体采用多面体比例边界有限单元（PSBFE）,建立了一种快速、高效的FE-PSBFE弹塑性耦合数值分析方法。采用实现的PSBFE对标准土石坝进行数值模拟,验证了其正确性和计算精度;通过典型复杂心墙坝对提出FE-PSBFE耦合方法的灵活性、通用性和高效性进行了研究,研究结果表明：与传统FEM相比,该耦合方法可大幅加速模型前处理进程,解决了复杂三维空间河谷形状、水平分层填筑和材料分区导致的网格剖分难题,几十万单元的网格划分一般仅需几分钟;与PSBFE相比,显著提高了岩土结构弹塑性分析的效率,FE-PSBFE可减少超过80%的求解时间。FE-PSBFE耦合方法对其他复杂几何条件的工程问题也具有良好的实用性,为快速精细化抗震分析提供了技术手段。     

Memory-efficient real-time map building using octree of planes and points

This paper presents an octree-based map building algorithm for mobile home-service robots. The robot is equipped with a time-of-flight camera, which produces point clouds of the environment surfaces. Given the successive input of point clouds, a 3D map is incrementally computed in real time. The map is accurate and memory-efficient because the octree nodes containing points on a plane are merged and represented simply by an index to the plane. The real-time performance is achieved largely due to the parallel processing capability of the many-core Graphics Processing Unit used for plane extraction.