z-logo
Premium
Ray‐Casted BlockMaps for Large Urban Models Visualization
Author(s) -
Cigi P.,
Di Benedetto M.,
Ganovelli F.,
Gobbetti E.,
Marton F.,
Scopigno R.
Publication year - 2007
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/j.1467-8659.2007.01063.x
Subject(s) - rendering (computer graphics) , computer science , tree traversal , computer graphics (images) , shader , generality , bounded function , opengl , exploit , scene graph , visualization , artificial intelligence , algorithm , psychology , mathematical analysis , mathematics , computer security , psychotherapist
Abstract We introduce a GPU‐friendly technique that efficiently exploits the highly structured nature of urban environments to ensure rendering quality and interactive performance of city exploration tasks. Central to our approach is a novel discrete representation, called BlockMap, for the efficient encoding and rendering of a small set of textured buildings far from the viewer. A BlockMap compactly represents a set of textured vertical prisms with a bounded on‐screen footprint. BlockMaps are stored into small fixed size texture chunks and efficiently rendered through GPU raycasting. Blockmaps can be seamlessly integrated into hierarchical data structures for interactive rendering of large textured urban models. We illustrate an efficient output‐sensitive framework in which a visibility‐aware traversal of the hierarchy renders components close to the viewer with textured polygons and employs BlockMaps for far away geometry. Our approach provides a bounded size far distance representation of cities, naturally scales with the improving shader technology, and outperforms current state of the art approaches. Its efficiency and generality is demonstrated with the interactive exploration of a large textured model of the city of Paris on a commodity graphics platform.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here