首页 | 本学科首页   官方微博 | 高级检索  
     


Visibility Culling Algorithm with Hierarchical Adaptive Bounding Setting
Authors:ZHENG Fu-ren  LI Feng-xi  ZHAN Shou-yi and YANG Bing
Affiliation:School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, China;School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, China;School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, China;School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, China
Abstract:Hierarchical adaptive bounding setting (HABS), a novel algorithm to reduce potentially visible set, is designed to be used for various geometry shape character in complex simulation scene to greatly improve geometry spatial storage precision. A spatial hierarchy tree is used to represent the topology of the model, and then the visibility geometry set from the viewpoint is determined by processing the hierarchy tree and frustum detection. In this process, HABS improves the viewpoint-to-region visibility detection efficiently. The algorithm is well-suited for complex models whose shape characters are various.
Keywords:HABS  visibility culling  octree  adaptive bounding  frustum
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《北京理工大学学报(英文版)》浏览原始摘要信息
点击此处可从《北京理工大学学报(英文版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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