Multidimensional binary indexing for neighbourhood calculations in spatial partition trees. Poveda, J. & Gould, M. Computers & Geosciences, 31(1):87-97, 2, 2005.
Multidimensional binary indexing for neighbourhood calculations in spatial partition trees [link]Website  abstract   bibtex   
We present a binary array encoding (location arrays) of the nodes in a spatial partition tree representing spaces of dimension k. This framework facilitates tree traversal for optimizing access speed, and also supports simplified calculation of the neighbourhood of a subinterval of a particular partition. After defining the encoding we present a neighbour determination algorithm which extends work carried out by Samet, Goodchild and others on quadtrees, of particular interest when managing large data volumes during real-time terrain flyovers. The primary extension is that the encoding and the neighbour determination algorithm extend to arbitrary dimensions beyond the 2-d quadtree case. © 2004 Elsevier Ltd. All rights reserved.
@article{
 title = {Multidimensional binary indexing for neighbourhood calculations in spatial partition trees},
 type = {article},
 year = {2005},
 identifiers = {[object Object]},
 keywords = {Binary location array,Multidimensional indexing,Multiresolution,Neighbour calculation,Spatial partition tree,Terrain visualization},
 pages = {87-97},
 volume = {31},
 websites = {http://www.scopus.com/inward/record.url?eid=2-s2.0-11144250789&partnerID=tZOtx3y1},
 month = {2},
 id = {e5366980-301d-39c4-96ec-40eeb3005b1c},
 created = {2016-03-16T15:11:04.000Z},
 accessed = {2016-03-16},
 file_attached = {false},
 profile_id = {0a9a0ca7-e30a-305c-9a1e-1cc541ed5c45},
 group_id = {378eded2-9912-3700-bd6d-56be53368f0b},
 last_modified = {2016-03-16T15:11:04.000Z},
 read = {false},
 starred = {false},
 authored = {false},
 confirmed = {true},
 hidden = {false},
 abstract = {We present a binary array encoding (location arrays) of the nodes in a spatial partition tree representing spaces of dimension k. This framework facilitates tree traversal for optimizing access speed, and also supports simplified calculation of the neighbourhood of a subinterval of a particular partition. After defining the encoding we present a neighbour determination algorithm which extends work carried out by Samet, Goodchild and others on quadtrees, of particular interest when managing large data volumes during real-time terrain flyovers. The primary extension is that the encoding and the neighbour determination algorithm extend to arbitrary dimensions beyond the 2-d quadtree case. © 2004 Elsevier Ltd. All rights reserved.},
 bibtype = {article},
 author = {Poveda, José and Gould, Michael},
 journal = {Computers & Geosciences},
 number = {1}
}

Downloads: 0