Accelerating Urban Scenes Visualization Using a Quadtree Decomposition of Urban Blocks

A data structure based on urban blocks which vastly improves rendering speed in urban walkthroughs and flights is presented in this paper. The city is split by means of a special quadtree partition and the block is adopted as the basic urban unit. One advantage of blocks is that they can be easily identified in any urban environment, regardless of the origins and structure of the entry data. Results are promising and lead to a factor three increase in rendering speed.

[1]  Jürgen Döllner,et al.  Continuous level-of-detail modeling of buildings in 3D city models , 2005, GIS '05.

[2]  Ramesh C. Jain,et al.  Similarity indexing: algorithms and performance , 1996, Electronic Imaging.

[3]  William Ribarsky,et al.  Real-time visualization of scalably large collections of heterogeneous objects , 1999, Proceedings Visualization '99 (Cat. No.99CB37067).

[4]  Jihad El-Sana,et al.  External Memory View‐Dependent Simplification , 2000, Comput. Graph. Forum.

[5]  Carlo H. Séquin,et al.  Adaptive display algorithm for interactive frame rates during visualization of complex virtual environments , 1993, SIGGRAPH.

[6]  Michael Wimmer,et al.  Automatic impostor placement for guaranteed frame rates and low memory requirements , 2005, I3D '05.

[7]  Ramesh C. Jain,et al.  Similarity indexing with the SS-tree , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[8]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[9]  George Drettakis,et al.  Efficient Impostor Manipulation for Real‐Time Visualization of Urban Scenery , 1997, Comput. Graph. Forum.

[10]  Shin'ichi Satoh,et al.  The SR-tree: an index structure for high-dimensional nearest neighbor queries , 1997, SIGMOD '97.

[11]  David Salesin,et al.  Hierarchical image caching for accelerated walkthroughs of complex environments , 1996, SIGGRAPH.

[12]  Renato Pajarola.  Large scale terrain visualization using the restricted quadtree triangulation , 1998 .

[13]  Frédo Durand,et al.  A Survey of Visibility for Walkthrough Applications , 2003, IEEE Trans. Vis. Comput. Graph..

[14]  Oliver Günther,et al.  Multidimensional access methods , 1998, CSUR.

[15]  Carlo H. Séquin,et al.  Occlusion horizons for driving through urban scenery , 2001, I3D '01.

[16]  Carlo H. Séquin,et al.  Visibility preprocessing for interactive walkthroughs , 1991, SIGGRAPH.

[17]  Michael Wimmer,et al.  Coherent Hierarchical Culling: Hardware Occlusion Queries Made Useful , 2004, Comput. Graph. Forum.

[18]  Pere Brunet,et al.  Object representation by means of nonminimal division quadtrees and octrees , 1985, TOGS.

[19]  Marios Hadjieleftheriou,et al.  R-Trees - A Dynamic Index Structure for Spatial Searching , 2008, ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems.

[20]  Jon Louis Bentley,et al.  Quad trees a data structure for retrieval on composite keys , 1974, Acta Informatica.

[21]  Vlastimil Havran,et al.  Exploiting temporal and spatial coherence in hierarchical visibility algorithms , 2001, Proceedings Spring Conference on Computer Graphics.