The Virtual Forest
Daniel Wesslén, Stefan Seipel · 2004
Display differs from [Weber and Penn 1995] in two important aspects—the original algorithm had to traverse the entire tree to select which parts of it were to be rendered, and leaves were singlycolored complex shapes. We use prearranged vertex buffers and select parts of the tree by computing index ranges in these. Leaves are rendered as textured quads, improving storage efficiency and detail. Shapes may be applied to the leaves by alpha testing.