Detailed Information
Cited 2 time in 
Cited 2 time in 
Cited 2 time in
Metadata Downloads
A real time system for indoor shortest path query with indexed indoor datasets
- Authors
- Shao, Z.; Lee, J.B.; Taniar, D.; Bo, Y.
- Issue Date
- 2016
- Publisher
- Springer Verlag
- Citation
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v.9877 LNCS, pp.440 - 443
- Volume
- 9877 LNCS
- Start Page
- 440
- End Page
- 443
- ISSN
- 0302-9743
- Abstract
- In comparison to query processing in spatial road networks, indoor query processing is not well studied due to limited number of available indoor datasets. In this paper, we present a system to represent floor plans of indoor spaces which enables users to find the shortest path between two indoor locations. Indoor spaces, such as shopping malls and office buildings, contain a large number of rooms and doors, which cause some difficulties to people to find their ways inside the building such as a large shopping centre. We have developed a system that is used to index floor plans and allow users to specify any two given locations and calculate the shortest path. © Springer International Publishing AG 2016.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - ETC > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.