Multidimensional binary indexing for neighbourhood calculations in spatial partition trees. Poveda, J. & Gould, M. Computers & Geosciences, 31(1):87-97, 2, 2005. 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
{"_id":"QSttBHCY9pf2wtcoH","bibbaseid":"poveda-gould-multidimensionalbinaryindexingforneighbourhoodcalculationsinspatialpartitiontrees-2005","downloads":0,"creationDate":"2016-03-30T10:10:38.294Z","title":"Multidimensional binary indexing for neighbourhood calculations in spatial partition trees","author_short":["Poveda, J.","Gould, M."],"year":2005,"bibtype":"article","biburl":null,"bibdata":{"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","bibtex":"@article{\n title = {Multidimensional binary indexing for neighbourhood calculations in spatial partition trees},\n type = {article},\n year = {2005},\n identifiers = {[object Object]},\n keywords = {Binary location array,Multidimensional indexing,Multiresolution,Neighbour calculation,Spatial partition tree,Terrain visualization},\n pages = {87-97},\n volume = {31},\n websites = {http://www.scopus.com/inward/record.url?eid=2-s2.0-11144250789&partnerID=tZOtx3y1},\n month = {2},\n id = {e5366980-301d-39c4-96ec-40eeb3005b1c},\n created = {2016-03-16T15:11:04.000Z},\n accessed = {2016-03-16},\n file_attached = {false},\n profile_id = {0a9a0ca7-e30a-305c-9a1e-1cc541ed5c45},\n group_id = {378eded2-9912-3700-bd6d-56be53368f0b},\n last_modified = {2016-03-16T15:11:04.000Z},\n read = {false},\n starred = {false},\n authored = {false},\n confirmed = {true},\n hidden = {false},\n 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.},\n bibtype = {article},\n author = {Poveda, José and Gould, Michael},\n journal = {Computers & Geosciences},\n number = {1}\n}","author_short":["Poveda, J.","Gould, M."],"urls":{"Website":"http://www.scopus.com/inward/record.url?eid=2-s2.0-11144250789&partnerID=tZOtx3y1"},"bibbaseid":"poveda-gould-multidimensionalbinaryindexingforneighbourhoodcalculationsinspatialpartitiontrees-2005","role":"author","keyword":["Binary location array","Multidimensional indexing","Multiresolution","Neighbour calculation","Spatial partition tree","Terrain visualization"],"downloads":0},"search_terms":["multidimensional","binary","indexing","neighbourhood","calculations","spatial","partition","trees","poveda","gould"],"keywords":["binary location array","multidimensional indexing","multiresolution","neighbour calculation","spatial partition tree","terrain visualization"],"authorIDs":[]}