@inProceedings{
 title = {Directional neighbourhood calculations in spatial partition trees},
 type = {inProceedings},
 year = {2004},
 identifiers = {[object Object]},
 pages = {824-828},
 volume = {15},
 websites = {http://www.scopus.com/inward/record.url?eid=2-s2.0-10044287362&partnerID=tZOtx3y1},
 id = {2d213840-9bff-3cda-abb8-7082149e0a24},
 created = {2016-03-16T14:56:32.000Z},
 file_attached = {false},
 profile_id = {0a9a0ca7-e30a-305c-9a1e-1cc541ed5c45},
 group_id = {378eded2-9912-3700-bd6d-56be53368f0b},
 last_modified = {2016-03-16T14:56:32.000Z},
 read = {false},
 starred = {false},
 authored = {false},
 confirmed = {true},
 hidden = {false},
 abstract = {We present an extension of the multidimensional binary indexing algorithm 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.},
 bibtype = {inProceedings},
 author = {Poveda, Jose and Gould, Michael},
 booktitle = {International Conference on Database and Expert Systems Applications - DEXA}
}

{"_id":"ie2XyiwNxzRLrNjh8","bibbaseid":"poveda-gould-directionalneighbourhoodcalculationsinspatialpartitiontrees-2004","downloads":0,"creationDate":"2016-03-30T10:10:38.132Z","title":"Directional neighbourhood calculations in spatial partition trees","author_short":["Poveda, J.","Gould, M."],"year":2004,"bibtype":"inProceedings","biburl":null,"bibdata":{"title":"Directional neighbourhood calculations in spatial partition trees","type":"inProceedings","year":"2004","identifiers":"[object Object]","pages":"824-828","volume":"15","websites":"http://www.scopus.com/inward/record.url?eid=2-s2.0-10044287362&partnerID=tZOtx3y1","id":"2d213840-9bff-3cda-abb8-7082149e0a24","created":"2016-03-16T14:56:32.000Z","file_attached":false,"profile_id":"0a9a0ca7-e30a-305c-9a1e-1cc541ed5c45","group_id":"378eded2-9912-3700-bd6d-56be53368f0b","last_modified":"2016-03-16T14:56:32.000Z","read":false,"starred":false,"authored":false,"confirmed":"true","hidden":false,"abstract":"We present an extension of the multidimensional binary indexing algorithm 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.","bibtype":"inProceedings","author":"Poveda, Jose and Gould, Michael","booktitle":"International Conference on Database and Expert Systems Applications - DEXA","bibtex":"@inProceedings{\n title = {Directional neighbourhood calculations in spatial partition trees},\n type = {inProceedings},\n year = {2004},\n identifiers = {[object Object]},\n pages = {824-828},\n volume = {15},\n websites = {http://www.scopus.com/inward/record.url?eid=2-s2.0-10044287362&partnerID=tZOtx3y1},\n id = {2d213840-9bff-3cda-abb8-7082149e0a24},\n created = {2016-03-16T14:56:32.000Z},\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-16T14:56:32.000Z},\n read = {false},\n starred = {false},\n authored = {false},\n confirmed = {true},\n hidden = {false},\n abstract = {We present an extension of the multidimensional binary indexing algorithm 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.},\n bibtype = {inProceedings},\n author = {Poveda, Jose and Gould, Michael},\n booktitle = {International Conference on Database and Expert Systems Applications - DEXA}\n}","author_short":["Poveda, J.","Gould, M."],"urls":{"Website":"http://www.scopus.com/inward/record.url?eid=2-s2.0-10044287362&partnerID=tZOtx3y1"},"bibbaseid":"poveda-gould-directionalneighbourhoodcalculationsinspatialpartitiontrees-2004","role":"author","downloads":0},"search_terms":["directional","neighbourhood","calculations","spatial","partition","trees","poveda","gould"],"keywords":[],"authorIDs":[]}