期刊文献+

快速高精度的可见面选择 被引量:2

Fast Selecting Visible Surfaces in High Precision
下载PDF
导出
摘要 高效地选取可见面,对于复杂场景的快速绘制是非常重要的.提出一种可见面的选择方法,能将基于图像空间或基于物体空间的可见面选择进行高效的结合,实现可见面的快速高精度的选取.首先,它对场景中的面片进行基于法向的分类,并根据面片的空间位置,为每一类面片分别建立一种层次形式的索引结构进行管理;然后在绘制过程中,基于像素驱动对可见面片进行由近及远的选取.由于索引结构对面片进行了有序的管理,这种选取计算很快,并能将可见面都选取出来,而已绘制的可见面的集合又能自动地成为遮挡者,隐含地剔除了大量的不可见面.与目前国际上关于可见性处理的方法相比,新方法对可见面的选取具有很高的精度,速度很快,并且能够方便地处理带有动态物体的场景. It is very important to efficiently select visible surfaces in rendering complex scenes. As for this, a method is presented in this paper by combining the strategies for image-based selection and object-based selection. First, it classifies the surfaces by their normals, and manages every class of surfaces in hierarchical indexing structures by their positions in 3D space. Then, the visible surfaces are pixel-driven searched from near to far. As the index structures can manage the surfaces orderly, this search can be calculated quickly and all visible surfaces can be obtained. Meanwhile, the selected visible surfaces can be fused automatically to act as the occluders to implicitly cull the occluded surfaces in large quantities. Compared with existing methods for selecting visible surfaces, the new method is fast and in high precision, and can conveniently handle the scenes with dynamic objects.
出处 《软件学报》 EI CSCD 北大核心 2006年第10期2199-2210,共12页 Journal of Software
基金 No.60373051(国家自然科学基金) No.2002CB312102(国家重点基础研发规划(973)) 澳门大学资助项目~~
关键词 可见性 高精度 快速 复杂场景 动态物体 visibility high precision fast complex scenes dynamic objects
  • 相关文献

参考文献22

  • 1Montrym J, Baum D, Dignam D, Migdal C. Infinite reality: A real-time graphics system. In: Proc. of the SIGGRAPH'97. Los Angeles, 1997.293-303. http://www.cs.utexas.edu/users/amenta/gmv/infinite.pdf
  • 2McCormack J, McNamara R, Gianos C, Seller L, Jouppi N, Correll K. Neon: A single-chip 3D workstation graphics accelerator. In: Proc. of the Eurographics/SIGGRAPH Workshop on Graphics Hardware. Lisboa, 1998. 123-132. http://www.cs.virginia.edu/-gfx/Courses/2002/BigData/papers/Case%20Studies/Neon%20-%20A%20Single-Chip%203D%20Workstation%20Graphics%20Accelerator.pdf
  • 3nVIDIA. GeForce 6 series technical briefs. 2004. http://www.nvidia.com/object/geforce_6_series_tech_briefs.html
  • 4Zhang H, Manocha D, Hudson T, Hoff III KE. Visibility culling using hierarchical occlusion maps. In: Proc. of the SIGGRAPH'97. Los Angeles, 1997. 77-88. http://citeseer.ist.psu.edu/zhang97visibility.html
  • 5Bartz D, MeiBner M, Huttner T. OpenGL-Assisted occlusion culling of large polygonal models. Computers and Graphics-Special Issue on Visibility-Techniques and Applications, 1999,23(5):667-679.
  • 6Arvo J, Kirk D. Fast ray tracing by ray classification. Computer Graphics, 1987,21(4):55-64.
  • 7Teller ST, Sequin CH. Visibility preprocessing for interactive walkthroughs. Computer Graphics, 1991,25(4):61-69.
  • 8Schaufler G, Dorsey J, Decoret X, Sillion F. Conservative volumetric visibility with occluder fusion. In: Proc. of the SIGGRAPH 2000. New orleans, 2000. 229-238. http://groups.csail.mit.edu/graphics/pubs/siggraph2000_consvol.pdf
  • 9Durand F, Drettakis G, Thollot T, Puech T. Conservative visibility preprocessing using extended projections. In: Proc. of the SIGGRAPH 2000. New Orleans, 2000. 239-248. http://people.csail.mit.edu/fredo/sig2000/occluext.pdf
  • 10Rohlf J, Helman J. IRIS performer: A high performance multiprocessing toolkit for real-time 3D graphics. In: Proc. of the SIGGRAPH'94. Chicago, 1994. 381-394. http://www.cs.virginia.edu/-gfx/Courses/2002/BigData/papers/Interfaces%20and%20Software%20Systems/IRIS%20Performer.pdf

同被引文献6

  • 1普建涛,查红彬.大规模复杂场景的可见性问题研究[J].计算机研究与发展,2005,42(2):236-246. 被引量:19
  • 2Akenine-Moller Tomas, Haines Eric.实时计算机图形学[M].普建涛,译.北京:北京大学出版社,2004.202-210.
  • 3Deloura M.游戏编程精粹[M].王叔礼,张磊,译.北京:人民邮电出版社,2004.398-406.
  • 4Hsu Chih-Kang, Tai Wen-Kai, Chiang Cheng-Chin, et al. Exploiting hardware-accelerated occlusion queries for visibility culling [J ]. IEICE Transactions on Fundamentals, 2005, E88A(7) : 2007-2014.
  • 5Bittner J, Wimmer M, Piringer H, et al. Coherent hierarchical culling: hardware occlusion queries made useful [J]. Computer Graphics Forum, 2004, 23(3) : 615-624.
  • 6梁爱民,梁晓辉,于卓.一种基于松散八叉树的复杂场景可见性裁剪算法[J].计算机辅助设计与图形学学报,2007,19(12):1593-1598. 被引量:7

引证文献2

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部