摘要
本文针对复杂多边形场景的漫游提出了一个新的预处理方法，并给出了相应的快速漫游算法．新方法在预处理阶段，把观察者可到达的空间分割成许多长方体视点区域，然后对每一个视点区域，适应性地剖分其对应的5D光线空间，使得分割后得到的光束所对应的PVS的元素个数小于某一给定的值，并对大于该值的最小光来进行简化．在漫游过程中，由存储的数据直接得到当前视点的PVS和细节的简化结果，并可快速有效地进行视域裁剪，从而大大加速了漫游时的绘制速度，使得绘制时间独立于场景的复杂度．
This paper proposes a novel preprocessing method for interactive walkthroughs of complex polygonal virtual environments, and also presents a fast corresponding walkthrough algorithm.In the preprocessing phase, the method divides the reachable space into many rectangular regions,and then, for each viewpoint region, the method adaptively partitions its 5D ray space into beams,so that the elements of PVS for resultant beams are less than a pre-set number- The smallest beamsfor which the elements of PVS are more than the pre-set number are simplified. During an interactive walkthrough, the PVS and simplification results related to the current viewpoint can be directlyretrieved from the storage, and the view volume clipping can also be efficiently implemented.Therefore, the method greatly accelerates the rendering speed in the walkthrough, as the result,the rendering time is independent of the scene complexity.
出处
《计算机学报》
EI
CSCD
北大核心
1998年第9期787-792,共6页
Chinese Journal of Computers
基金
国家自然科学基金
