@article{MAKHILLAJIT2004354709,
    title = {Real-Time Level of Detail Terrain Meshing Algorithm with Storage Efficient Binary Coordinate Tree using OpenGL},
    journal = {Asian Journal of Information Technology},
    volume = {3},
    number = {5},
    pages = {329-335},
    year = {2004},
    issn = {1682-3915},
    doi = {ajit.2004.329.335},
    url = {https://makhillpublications.co/view-article.php?issn=1682-3915&doi=ajit.2004.329.335},
    author = {A. S. M. Mahfujur Rahman},
    keywords = {},
    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.}
    }