首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2篇
  免费   0篇
综合类   2篇
  2006年   2篇
排序方式: 共有2条查询结果,搜索用时 15 毫秒
1
1.
Recent yearsin graphics area many rendering al-gorithms have been developed to support a newset ofdemanding applications.An efficient way to speed uprenderingis to avoid rendering geometry that cannotbe seen from current viewpoint,such as geometryoutside the current viewfrustumand obscured by ge-ometrythat is closer tothe current viewer.The hard-est part of the visibility culling problem is how toavoid rendering geometry whichis obscured by closergeometry.Our approach will focus on this.In thi…  相似文献   
2.
Visibility Culling Algorithm with Hierarchical Adaptive Bounding Setting   总被引:1,自引:0,他引:1  
Visibility determination is an i mportant task incomputer graphics.The goal of visibility determina-tion is to efficiently determine visible parts of themodel given a viewpoint and a viewing direction.Toachieve the output-sensitivity of the visibility algo-rithm,we exploit the idea of hierarchical adaptivebounding setting(HABS);it is used to effectivelydetermine a subset of potentially visible sets(PVS)objects.In addition,some flexible culling strategiestoi mprove frame rate per second are …  相似文献   
1
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号