共查询到19条相似文献,搜索用时 109 毫秒
1.
在三维场景仿真过程中,为了实现真实的光影效果,通常采用光线追踪法对场景进行渲染。光线追踪算法的核心过程是光线与场景中的片元进行相交测试,而对于一个复杂的场景,该过程计算量非常大。为了改善光线追踪算法的计算速度问题,实现一种基于CUDA(Compute Unified Device Architecture)的光线追踪算法。该算法利用GPU的并行处理能力同时结合KD-Tree加速相交测试过程,最终提高仿真场景的渲染速度。通过实验表明,该算法的KD-Tree创建性能相比传统方法提升约20%,光线追踪性能提升约6倍。 相似文献
2.
针对传统的环境光遮挡算法中不能自适应的问题,提出了基于GPU自适应的环境遮挡算法.该算法充分利用了GPU并行计算技术和离屏渲染技术,快速计算出适合所载入场景的自适应步长;并将传统环境遮挡采样方法和抖动采样的思想相结合,对采样方法进行了改进;同时也简化了传统环境光遮挡算法中最终遮挡值的计算.实验结果表明,该方法不局限于特定场景,不需要对场景进行预处理,可以准确高效的计算环境光的遮挡情况,并且实现实时绘制. 相似文献
3.
关于在动态障碍物特性的问题,研究了动态障碍物与流体进行交互的计算机三维仿真,为达到仿真的有效性和高效性要求,提出了算子替代方法并对三维体素进行优化,通过内-外体素化方法对障碍物进行离散,同时指定动态障碍物边界条件,将动态障碍物边界表示成随障碍物移动或变形而变化的压力纹理和速度纹理,从而影响流体网格产生自由滑动。仿真实验证明,方法不仅更适合于GPU的计算模型,而且经过优化后具有更好的仿真速度和稳定性。 相似文献
4.
5.
GPU中的流体场景实时模拟算法 总被引:2,自引:0,他引:2
为了实时模拟真实的大规模流体场景,提出一种基于平滑粒子流体力学(SPH)进行流体场景模拟的算法.首先提出了新的精细程度函数作为非均匀采样的依据,以减少实际模拟时所需的粒子数,提高模拟的速度;然后引入一种三维空间网格划分算法和改进的并行基数排序算法,以加快模拟过程中对邻域粒子和边界的查找及其相互作用的计算;最后使用最新的NVIDIA(CUDA(架构,将SPH的全部模拟计算分配到GPU流处理器中,充分利用GPU的高并行性和可编程性,使得对SPH方法的流体计算和模拟达到实时.实验结果表明,采用文中算法能对流体场景的计算模拟达到实时,并实现比较真实的模拟效果.与已有的SPH流体CPU模拟方法相比,其加速比达到2个数量级以上,同时相比已有GPUSPH方法,能模拟出更为丰富的细节效果. 相似文献
6.
采用GPU的遮挡查询功能提出了一种复杂场景的层次遮挡剔除算法,通过交替进行遮挡查询和可见节点的绘制,有效地减少了由于遮挡查询延迟造成的空闲等待时间.为了减少场景中不必要的遮挡测试,将遮挡查询问题描述为最优化决策问题,通过对每一帧遮挡查询的选择进行优化,能够使整个场景绘制的效率近似达到最优.实验结果表明,对于不同复杂度的场景,该算法可以明显地提高场景的绘制速度. 相似文献
7.
论文算法面向于书脊图像,解决了SIFT特征提取与匹配计算过程中耗时过长的问题,实现了一种基于统一计算设备架构(CUDA)加速的SIFT特征提取与匹配的算法.该方法充分利用图像处理单元(GPU)的并行计算和浮点计算能力,大幅度的提高算法运行速度,论文将应用于智能书柜场景中,书脊图像具有角度不一,数据量大等问题,该算法解决了准确性和实时性问题. 相似文献
8.
提出了一种基于开放运算语言(OpenCL)的GPU加速三维时域有限差分(FDTD)电磁场仿真计算的方法.该方法利用图形处理单元(GPU)的并行处理特性并结合OpenCL接口标准实现了时域卷积完全匹配层(CPML)吸收边界条件的三维FDTD的高性能加速计算.首先设置FDTD仿真参数并动态申请内存空间,然后初始化OpenCL的计算参数,对三维电磁模型基于OpenCL进行FDTD加速仿真.本方法显著提升了FDTD电磁场仿真速度,与利用CPU计算相比速度提升可达5-8倍,且具有CPML吸收边界条件,可以模拟电磁波在自由空间的传播;基于OpenCL编译的语言程序可以运行在CPU或GPU硬件上,并可充分发挥多核CPU的并行计算能力,使得FDTD电磁场仿真具有更广泛的实际应用. 相似文献
9.
以三维网格模型的微分几何信息为依据,结合视点相关和视点无关的线绘制方法,提出一种基于GPU的实时绘制算法.基于视点曲率在图像空间中计算提取视点相关特征线,同时利用风格化纹理和主曲率信息绘制视点无关特征线.根据三维模型信息与预设计的风格化纹理,在像素着色器中对视点相关和视点无关的2类特征信息进行计算,然后结合两者结果得到令人满意的绘制结果.实验结果表明,由于所有计算在图像空间由GPU并行完成,可以高效地提取特征线;采用风格化纹理的设计增加了图像空间风格化绘制的可控性,弥补了图像空间算法的风格化可控性差的缺点.此外,文中算法不仅可以进行实时的风格化线绘制,以该算法为基础还可以进行进一步的艺术仿真,如国画的模拟等. 相似文献
10.
11.
Hsu-Huai Chang Yu-Chi Lai Chin-Yuan Yao Kai-Lung Hua Yuzhen Niu Feng Liu 《The Visual computer》2014,30(3):327-340
This work proposes a new voxelization algorithm based on newly available GPU functionalities and designs several real-time applications to render complex lighting effects with the voxelization result. The voxelization algorithm can efficiently transform a highly complex scene in a surface-boundary representation into a set of voxels in one GPU pass using the geometry shader. Newly available 3D textures are used to directly record the surficial and volumetric properties of objects such as opaqueness, refraction, and transmittance. In the first, the usage of 3D textures can remove those strenuous efforts required to modify the encoding and decoding scheme when adjusting the voxel resolution. Second, surficial and volumetric properties recorded in 3D textures can be used to interactively compute and render more realistic lighting effects including the shadow of objects with complex occlusion and the refraction and transmittance of transparent objects. The shadow can be rendered with an absorption coefficient which is computed according to the number of surfaces drawing in each voxel during voxelization and used to compute the amount of light passing through partially occluded complex objects. The surface normal, transmittance coefficient and refraction index recorded in each voxel can be used to simulate the refraction and transmittance lighting effects of transparent objects using our multiple-surfaced refraction algorithm. Finally, the results demonstrate that our algorithm can transform a dynamic scene into a set of voxels and render complex lighting effects in real time without any pre-processing. 相似文献
12.
针对传统边界元法计算量大、计算效率低的问题,以三维弹性静力学的边界元法为对象,将基于CUDA的GPU并行计算应用到其边界元计算中,提出了基于CUDA架构的GPU并行算法.该算法首先对不同类型的边界元系数积分进行并行性分析,描述了相关的GPU并行算法,然后阐述了边界元方程组的求解方法及其并行策略.实验结果表明,文中算法较传统算法具有显著的加速效果. 相似文献
13.
We describe how the pipeline for 3D online reconstruction using commodity depth and image scanning hardware can be made scalable for large spatial extents and high scanning resolutions. Our modified pipeline requires less than 10% of the memory that is required by previous approaches at similar speed and resolution. To achieve this, we avoid storing a 3D distance field and weight map during online scene reconstruction. Instead, surface samples are binned into a high‐resolution binary voxel grid. This grid is used in combination with caching and deferred processing of depth images to reconstruct the scene geometry. For pose estimation, GPU ray‐casting is performed on the binary voxel grid. A one‐to‐one comparison to level‐set ray‐casting in a distance volume indicates slightly lower pose accuracy. To enable unlimited spatial extents and store acquired samples at the appropriate level of detail, we combine a hash map with a hierarchical tree representation. 相似文献
14.
Vivek Kwatra Philippos Mordohai Rahul Narain Sashi Kumar Penta Mark Carlsonk Marc Pollefeys Ming C. Lin 《Computer Graphics Forum》2008,27(2):487-496
We present a technique for coupling simulated fluid phenomena that interact with real dynamic scenes captured as a binocular video sequence. We first process the binocular video sequence to obtain a complete 3D reconstruction of the scene, including velocity information. We use stereo for the visible parts of 3D geometry and surface completion to fill the missing regions. We then perform fluid simulation within a 3D domain that contains the object, enabling one‐way coupling from the video to the fluid. In order to maintain temporal consistency of the reconstructed scene and the animated fluid across frames, we develop a geometry tracking algorithm that combines optic flow and depth information with a novel technique for “velocity completion”. The velocity completion technique uses local rigidity constraints to hypothesize a motion field for the entire 3D shape, which is then used to propagate and filter the reconstructed shape over time. This approach not only generates smoothly varying geometry across time, but also simultaneously provides the necessary boundary conditions for one‐way coupling between the dynamic geometry and the simulated fluid. Finally, we employ a GPU based scheme for rendering the synthetic fluid in the real video, taking refraction and scene texture into account. 相似文献
15.
The sense of being within a three-dimensional (3D) space and interacting with virtual 3D objects in a computer-generated virtual environment (VE) often requires essential image, vision and sensor signal processing techniques such as differentiating and denoising. This paper describes novel implementations of the Gaussian filtering for characteristic signal extraction and wavelet-based image denoising algorithms that run on the graphics processing unit (GPU). While significant acceleration over standard CPU implementations is obtained through exploiting data parallelism provided by the modern programmable graphics hardware, the CPU can be freed up to run other computations more efficiently such as artificial intelligence (AI) and physics. The proposed GPU-based Gaussian filtering can extract surface information from a real object and provide its material features for rendering and illumination. The wavelet-based signal denoising for large size digital images realized in this project provided better realism for VE visualization without sacrificing real-time and interactive performances of an application. 相似文献
16.
In this paper, we present a new adaptive model for real-time fluid simulation with complex boundaries based on Smoothed Particle
Hydrodynamics (SPH) framework. Firstly, we introduce an adaptive SPH framework that is based on our character field function
composed of four factors: geometrical complexity, boundary condition, physical complexity, and complementary condition in
terms of the neighboring particle number. Meanwhile, the rule for particle adaptation is presented. We also present a two-step
method to fast detect collision with complex boundary. The first step is voxelization on the complex scene. In the second
step, based on the result of voxelization, we propose a three-phase method to fast detect collisions between complex boundaries
and particles. By using this method, we avoid most of the useless intersection detection computation and greatly enhance the
computation efficiency. In addition, a subdivision of boundary is precomputed before the collision interaction method so that
fluid in a scene with complex boundary can still be simulated at relatively high speed and system stability risk is reduced
greatly. To further accelerate the simulation, a highly parallel fluid algorithm is presented and implemented using GPU so
that we can simulate dynamic fluid with mutual interaction between fluid and complex boundary at a considerably fast speed
without compromising realism. 相似文献
17.
现代3D图形处理器已从固定渲染管线发展成可编程渲染管线,且其并行度越来越高,研究并设计高性能的3D图形处理器对3D图形处理具有重要意义。着色器是实现3D图形处理器的核心,因此开发性能高、面积小、功耗低又易于扩展的着色器对3D图形处理器的开发具有重要作用。提出的统一架构图形处理器基于单指令多线程和单指令多数据,单指令多线程可以提高图形处理的并行度,从而提高图形处理性能;单指令多数据可以降低设计复杂度,从而实现面积小、功耗低又易于扩展的着色器。实验结果表明,提出的统一架构图形处理器在面积较小、功耗较低的情况下实现了较高的性能,且设计可扩展性较好。 相似文献
18.
固壁虚粒子边界处理方法是流体模拟中一种主要边界处理方法,但其不能确保流
体粒子不穿透固体边界,并且计算量较大。为防止流体粒子穿透边界,在边界附近设置一个阻
尼区,阻尼区内的流体粒子被边界施加一个弹性力和一个和流体粒子运动速度方向相反的阻尼
力,使得边界附近流体粒子更加稳定。为减少计算量,提出两种边界粒子自适应采样法:一种
是依据边界周围粒子数目的不同,边界粒子自适应地采样质量不同的大小粒子;另一种是依据
边界周围粒子数目的不同,边界粒子自适应的采样不同层数的相同质量粒子。与传统的固体边
界粒子采样方法相比,该方法减少了边界粒子数目,加快了模拟速度,节省了计算机内存,基
于GPU 加速技术实现的三维流体模拟,能够进行实时交互。 相似文献
19.
Rong G Liu Y Wang W Yin X Gu XD Guo X 《IEEE transactions on visualization and computer graphics》2011,17(3):345-356
Centroidal Voronoi tessellations (CVT) are widely used in computational science and engineering. The most commonly used method is Lloyd's method, and recently the L-BFGS method is shown to be faster than Lloyd's method for computing the CVT. However, these methods run on the CPU and are still too slow for many practical applications. We present techniques to implement these methods on the GPU for computing the CVT on 2D planes and on surfaces, and demonstrate significant speedup of these GPU-based methods over their CPU counterparts. For CVT computation on a surface, we use a geometry image stored in the GPU to represent the surface for computing the Voronoi diagram on it. In our implementation a new technique is proposed for parallel regional reduction on the GPU for evaluating integrals over Voronoi cells. 相似文献