Tree Branch Level of Detail Models for Forest Navigation
文献类型：期刊论文
| 作者 | Baoquan Chen; Xiaopeng Zhang; Guanbo Bao; Weiliang Meng; Marc Jaeger; Hongjun Li; Oliver Deussen |
| 刊名 | COMPUTER GRAPHICS FORUM
 |
| 出版日期 | 2017 |
| 文献子类 | 期刊论文 |
| 英文摘要 | We present a level of detail (LOD) method designed for tree branches. It can be combined with methods for processing tree foliage to facilitate navigation through large virtual forests. Starting from a skeletal representation of a tree, we fit polygon meshes of various densities to the skeleton while the mesh density is adjusted according to the required visual fidelity. For distant models, these branch meshes are gradually replaced with semi-transparent lines until the tree recedes to a few lines. Construction of these complete LOD models is guided by error metrics to ensure smooth transitions between adjacent LOD models. We then present an instancing technique for discrete LOD branch models, consisting of polygon meshes plus semi-transparent lines. Line models with different transparencies are instanced on the GPU by merging multiple tree samples into a single model. Our technique reduces the number of draw calls in GPU and increases rendering performance. Our experiments demonstrate that large-scale forest scenes can be rendered with excellent detail and shadows in real time. |
| URL标识 | 查看原文 |
| 语种 | 英语 |
| WOS记录号 | WOS:000417496200028 |
| 源URL | [http://ir.siat.ac.cn:8080/handle/172644/12446]  |
| 专题 | 深圳先进技术研究院_数字所 |
| 作者单位 | COMPUTER GRAPHICS FORUM |
| 推荐引用方式 GB/T 7714 | Baoquan Chen,Xiaopeng Zhang,Guanbo Bao,et al. Tree Branch Level of Detail Models for Forest Navigation[J]. COMPUTER GRAPHICS FORUM,2017. |
| APA | Baoquan Chen.,Xiaopeng Zhang.,Guanbo Bao.,Weiliang Meng.,Marc Jaeger.,...&Oliver Deussen.(2017).Tree Branch Level of Detail Models for Forest Navigation.COMPUTER GRAPHICS FORUM. |
| MLA | Baoquan Chen,et al."Tree Branch Level of Detail Models for Forest Navigation".COMPUTER GRAPHICS FORUM (2017). |
入库方式： OAI收割
来源：深圳先进技术研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。