This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Database and Expert Systems Applications, 15th International Workshop on (DEXA'04)
Directional Neighbourhood Calculations in Spatial Partition Trees
Zaragoza, Spain
August 30-September 03
ISBN: 0-7695-2195-9
Jos? Poveda, Universitat Jaume I, Spain
Michael Gould, Universitat Jaume I, Spain
We present an extension of the multidimensional binary indexing algorithm for neighbourhood calculations in spatial partition trees [Multidimensional Binary Indexing for Neighbourhood Calculations in Spatial Partition Trees]. The algorithm in the earlier paper provided a matrix characterization to support calculus of neighbours in a spatial partition tree representation. That calculus was implicitly defined only for face-to-face neighbours. The extension presented here considers any possible direction in which a neighbour sub-interval of a quadtree partition can be found, and not only along the coordinate axis. The paper starts from basic topological considerations in two dimensional space to finally generalize the result obtained for any arbitrary dimension. Finally, we present an explicit calculus of all neighbour location vectors of a given sub-interval as well as a graphic example in a three-dimensional space.
Citation:
Jos? Poveda, Michael Gould, "Directional Neighbourhood Calculations in Spatial Partition Trees," dexa, pp.824-828, Database and Expert Systems Applications, 15th International Workshop on (DEXA'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.