Adaptation of k-Nearest Neighbor Queries for Inter-building Environment

摘要

Nearest neighbor (kNN) is a spatial query where its main aim is to find k nearest object around a query point. This query has been widely used in outdoor environment to obtain point of interests in various GIS system, such as navigation and routing. The floor layout of a building can be represented with simple graph network. Unlike outdoor road network that usually only has single layer, an indoor network might have multiple layers which represents floors. In a multi-building area, buildings can be connected with the other buildings and create more complex network, which is called inter-building environment. In this paper, Dijkstra and Floyd Warshall algorithms as kNN algorithm are adapted and implemented in inter-building environment. Our experiments show that these algorithms are be able to adapt three dimensional graph for inter-building environment.