Affiliation:
1. College of Computing and Informatics, SEU, Riyadh, Saudi Arabia
2. Clayton School of Information Technology, Monash University, Melbourne, VIC, Australia
3. Department of Computer Science and Computer Engineering, La Trobe University, Melbourne, VIC, Australia
Abstract
The indexing and tracking of objects moving in indoor spaces has increasingly become an important area of research, which presents a fundamentally different challenge. There are two main reasons for why indoor should be treated as cellular space. Firstly, an indoor space has entities, such as rooms and walls, that constrain the movement of the moving objects. Secondly, the relevant notion of locations of an object is cell based rather than an exact Euclidean coordinate. As a solution, in our earlier works, we proposed a cell-based indexing structure, called the C-tree, for indexing objects moving in indoor space. In this paper, we extend the C-tree to solve another interesting problem. It can be observed that many indoor spaces (such as shopping centers) contain wings/sections. For such a space, there are queries for which the wing/section location of an object, rather than the cellular location, is the relevant answer (e.g., “the object is in the east wing”). In this paper, we propose a new index structure, called the GMI-tree (“GMI” stands for “Graph-based Multidimensional Index”). The GMI-tree is based on two notions of distance, or equivalently, two notions of adjacency: one represents horizontal adjacency and the other represents vertical adjacency.
Subject
Computer Networks and Communications,Computer Science Applications
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献