Asian Journal of Information Technology
ISSN: Online 1993-5994ISSN: Print 1682-3915
Abstract
The key to real-time rendering of large-scale surfaces is to locally adept surface geometric complexity to changing view parameters. The Level-of-Detail Algorithm ROAM employs top-down recursive approach in rendering the Binary Triangle Trees (BTT) and calculates the coordinates of the triangles (to be rendered) on the fly. Hence, to overcome both the top-down recursive rendering approach and runtime coordinate calculation of the BTT, this paper presents the concept of Binary Coordinate Trees (BCT). Frame-to-frame coherence and Linear rendering of the Connected Leaf List (LRCLL) has also been efficiently handled using BCT.
How to cite this article:
A. S. M. Mahfujur Rahman . Real-Time Level of Detail Terrain Meshing Algorithm with Storage Efficient Binary Coordinate Tree using OpenGL.
DOI: https://doi.org/10.36478/ajit.2004.329.335
URL: https://www.makhillpublications.co/view-article/1682-3915/ajit.2004.329.335