Premium
Tree Branch Level of Detail Models for Forest Navigation
Author(s) -
Zhang Xiaopeng,
Bao Guanbo,
Meng Weiliang,
Jaeger Marc,
Li Hongjun,
Deussen Oliver,
Chen Baoquan
Publication year - 2017
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/cgf.13088
Subject(s) - polygon mesh , polygon (computer graphics) , rendering (computer graphics) , computer science , tree (set theory) , computer graphics (images) , tree structure , vertex (graph theory) , fidelity , algorithm , artificial intelligence , theoretical computer science , mathematics , binary tree , graph , combinatorics , telecommunications , frame (networking)
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.