کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
10352929 865238 2005 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Multidimensional binary indexing for neighbourhood calculations in spatial partition trees
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نرم افزارهای علوم کامپیوتر
پیش نمایش صفحه اول مقاله
Multidimensional binary indexing for neighbourhood calculations in spatial partition trees
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Geosciences - Volume 31, Issue 1, February 2005, Pages 87-97
نویسندگان
, ,