计算机科学 ›› 2013, Vol. 40 ›› Issue (Z11): 296-300.

• 数字信息处理 • 上一篇    下一篇

一个根据几何信息对场景对象重组织以加速显示的方法

周毅敏,李光耀   

  1. 同济大学电信学院CAD中心 上海200080;同济大学电信学院CAD中心 上海200080
  • 出版日期:2018-11-16 发布日期:2018-11-16

Method for Accelerating Display Speed by Organizing Scene Objects via Geometric Data Analysis

ZHOU Yi-min and LI Guang-yao   

  • Online:2018-11-16 Published:2018-11-16

摘要: 大规模场景图形应用和交互系统常常需要同时处理大量的场景对象。虽然场景结构对每帧的显示速度有很大的影响,但近几年来的研究和关注的重点已不是场景对象的组织结构,而主要集中在诸如物体表面的简化以及每个对象的表示等一致性特征上。场景中的物体几何信息的一致性十分易于理解,文中提出一个基于这些几何信息的分析方法以提升特定场景的显示效率。这个方法主要是将场景组织成层级结构。还提出了这个方法的许多变化形式,其中有些仅使用场景对象的几何信息,有些利用了场景固有的几何性质,而有些则同时使用了这些信息。最后还展示了一些统计信息,以证实文中的方法对图形交互应用效能的提升。

关键词: 几何信息分析,聚类层级分析,群,剔除

Abstract: Graphical applications and interactive systems,especially applied in large scene simulation,are often required to display large quantities of objects synchronously.But not much attention has been focused on the organization of the scene structure which plays an important role in determining the speed of displaying the whole scene each frame respectively while much has been spent on surface simplification and other coherency within each object’s representation.Though the coherency within the scene is so simple to understand,this thesis will still present some also simple methodology which can be used to factually improve the efficiency in displaying the customized scene via applying geometric data analysis or related method.We presented a new method for representing a hierarchy of scene objects which partitions the scene into groups of objects termed as clouds of objects.The method has several variants,some of which applies only geometric data analysis,some of which just applies scene’s inherent geometrical property and others which applies both.Finally,we presented some statistics information to verify improvement by applying our method in graphical interactive systems.

Key words: Geometrical data analysis,AHC,Cloud,Culling

[1] Sutherland I E,Sproull R F,Schumaker R A.A characterization of ten hidden surface algorithms[J].ACM Computer Surveys,1974,6(1):1-55
[2] Clark J H.Hierarchical geometric models for visible surface algorithms[J].Communications of the ACM,1976,19(10):547-554
[3] Kumar S,Manocha D,Garrett W F,et al.Hierarchical back-face computation[J].Computers & Graphics,1999,3(5):681-692
[4] Roux B L,Rouanet H.Geometric Data Analysis:From Corre-spondence Analysis to Structured Data Analysis[M].Kluwer Academic Publishers,2004
[5] Cohen-Or D,Chrysanthou Y,Silva C,et al.A survey of visibility for walkthrough applications[J].IEEE Tr.Vis.and Comp.Graphics,2003,9(3):412-431
[6] Wonka P,Schmalstieg D.Occluder shadows for fast walk-throughs of urban environments[J].Eurographics,1999,18(3):51-60
[7] Schauer G,Dorsey J,Decoret X,et al.Conservative volumetricvisibility with occluder fusion[C]∥SIGGRAPH 2000Confe-rence Proceedings.July 2000:229-238
[8] Surdasky O,Gotsman C.Dynamic scene occlusion culling[J].IEEE Trans.on Visualization and Computer Graphics,1999,5(1):13-29
[9] Batagelo H,Wu S.Dynamic scene occlusion culling using a regular grid[C]∥Proceedings of the XV Brazilian Symposium on Computer Graphics and Image Processing.2002:43-50
[10] Lu T,Chang C.Distributed visibility culling technique for complex scene rendering[J].Visual Languages and Computing,2005,16(5):455-479
[11] Laine S.A general algorithm for output-sensitive visibility preprocessing[C]∥Proceedings of the 2005Symposium on Interactive 3D Graphics and Games.2005:31-40
[12] Djeu P,Keely S,Hunt W.Accelerating shadow rays using volumetric occluders and modi_ed kd-tree traversal[C]∥Procee-dings of the Conference on High Performance Graphics 2009.2009:69-76
[13] Kao C,Tsai R.Properties of a level set algorithm for the visibility problems[J].Scientific Computing,2008,35(2):170-191
[14] Choi B,Chang B,Ihm I.Technical section:Construction of efficient kd-trees for static scenes using voxel-visibility heuristic[J].Computers and Graphics,2012,36(1):38-48
[15] Jackins C,Tanimoto S L.Oct-trees and their use in representing 3-d objects[J].Computer Graphics and Image Processing,1980,14:249-270
[16] Reinhard E,Smits B,Hansen C.Dynamic acceleration structures for interactive ray tracing[C]∥Eurographics Workshop on Rendering.2000:299-306
[17] Luebke D,Erikson C.View-dependent simplification of arbitrary polygonal environments∥SIGGRAPH 97Proc.August 1997:199-208
[18] Xia J C,Varshney A.Dynamic view-dependent simplification for polygonal models[C]∥Proceedings of Visualization ’96.October 1996:327-334
[19] Garland M,Willmott A,Heckbert.Hierarchical face clustering on polygonal surfaces[C]∥Proceedings of the ACM Symposium on Interactive 3D Graphics.2001:49-58
[20] Barber C B,Dobkin D P,Huhdanpaa H T.The quickhull algorithm for convex hulls[J].ACM Trans.on Mathematical Software,1996,22(4):469-483
[21] Wong S K,Cheng Yu-chun,Lii S Y.GPU Ray Tracing Based on Reduced Bounding Volume Hierarchies[C]∥Proceedings of the Ninth International Conference on Computer Graphics,Imaging and Visualization.2012:1-6
[22] Wang Rui.Qian Xue-lei.OpenSceneGraph 3Cookbook[M].Packt Publishing, March 2012

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!