Title:	BQ-RTREE: A R-TREE DATA STRUCTURE IMPROVED BY A SPATIAL PARTITION IN QUADTREE
Author(s):	J. L. Pina , E. Cerezo , F. Seron
ISBN:	978-972-8924-84-3
Editors:	Yingcai Xiao, Tomaz Amon and Piet Kommers
Year:	2009
Edition:	Single
Keywords:	Visualization, Urban Scenes, BqR-Tree, Data structures, Quadtree, R-Tree.
Type:	Full Paper
First Page:	33
Last Page:	40
Language:	English
Cover:
Full Contents:	click to dowload
Paper Abstract:	BqR-Tree, the data structure presented in this paper is an improved R-Tree data structure based on a quadtree spatial partitioning which improves the rendering speed of the usual R-trees, especially in urban scenes. 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. The usefulness of the structure has been tested with low structured data, which makes its application appropriate to almost all city data. The results of the tests show that when using the BqR-Tree structure to perform walkthroughs and flights, rendering times vastly improve in comparison to the data structures which have yielded best results to date, with average improvements of around 30%.
	Go Back