Outdoor-indoor Space: Unified Modeling and Shortest Path Search

Søren Kejser Jensen; Jens Thomas Vejlby Nielsen; Hua Lu; Muhammad Aamir Cheema

doi:10.1145/3005422.3005427

Outdoor-indoor Space: Unified Modeling and Shortest Path Search

Søren Kejser Jensen, Jens Thomas Vejlby Nielsen, Hua Lu, Muhammad Aamir Cheema

Research output: Contribution to book/anthology/report/conference proceeding › Article in proceeding › Research › peer-review

5 Citations (Scopus)

Abstract

Graph models are widely used for representing the topology of outdoor space (O-Space) and indoor space (I-Space). However, existing models neglect the intersection between O-Space and I-Space, only allowing for computations such as shortest path and nearest neighbor queries in either O-Space or I-Space, separately. In this paper, we present two different outdoor-indoor space (OI-Space) models allowing queries to operate on a mix of both spaces. The first model keeps the distinct nature of the two spaces intact by having explicit connections between outdoor and indoor spaces. The second model abstracts this distinction away, and provides a unified model of outdoor-indoor space. For each model, we present an algorithm that is able to span the two types of spaces to return the real shortest path between two arbitrary points. The experimental evaluations show that the proposed models and algorithms perform well enough to be usable in practice.

Original language	English
Title of host publication	Proceedings of the Eighth ACM SIGSPATIAL International Workshop on Indoor Spatial Awareness
Editors	Muhammad Aamir Cheema, Mohammed Eunus Ali, Shiyu Yang
Number of pages	8
Publisher	Association for Computing Machinery
Publication date	31 Oct 2016
Pages	35-42
ISBN (Electronic)	978-1-4503-4585-9
DOIs	https://doi.org/10.1145/3005422.3005427
Publication status	Published - 31 Oct 2016
Event	Eighth ACM SIGSPATIAL International Workshop on Indoor Spatial Awareness - San Francisco Bay Area, California, United States Duration: 31 Oct 2016 → 3 Nov 2016 https://sites.google.com/site/indoorspatialawareness2016/

Workshop

Workshop	Eighth ACM SIGSPATIAL International Workshop on Indoor Spatial Awareness
Location	San Francisco Bay Area
Country/Territory	United States
City	California
Period	31/10/2016 → 03/11/2016
Internet address	https://sites.google.com/site/indoorspatialawareness2016/

Keywords

modeling outdoor-indoor space, shortest path search in outdoor-indoor space

Access to Document

10.1145/3005422.3005427

http://doi.acm.org/10.1145/3005422.3005427

AUB Link

Search for the material in Aalborg University Library's search engine

Cite this

@inproceedings{9793b590304a40cda875161732a6fd79,

title = "Outdoor-indoor Space: Unified Modeling and Shortest Path Search",

abstract = "Graph models are widely used for representing the topology of outdoor space (O-Space) and indoor space (I-Space). However, existing models neglect the intersection between O-Space and I-Space, only allowing for computations such as shortest path and nearest neighbor queries in either O-Space or I-Space, separately. In this paper, we present two different outdoor-indoor space (OI-Space) models allowing queries to operate on a mix of both spaces. The first model keeps the distinct nature of the two spaces intact by having explicit connections between outdoor and indoor spaces. The second model abstracts this distinction away, and provides a unified model of outdoor-indoor space. For each model, we present an algorithm that is able to span the two types of spaces to return the real shortest path between two arbitrary points. The experimental evaluations show that the proposed models and algorithms perform well enough to be usable in practice.",

keywords = "modeling outdoor-indoor space, shortest path search in outdoor-indoor space",

author = "Jensen, {S{\o}ren Kejser} and Nielsen, {Jens Thomas Vejlby} and Hua Lu and Cheema, {Muhammad Aamir}",

year = "2016",

month = oct,

day = "31",

doi = "10.1145/3005422.3005427",

language = "English",

pages = "35--42",

editor = "{ Aamir Cheema}, Muhammad and {Eunus Ali}, Mohammed and Shiyu Yang",

booktitle = "Proceedings of the Eighth ACM SIGSPATIAL International Workshop on Indoor Spatial Awareness",

publisher = "Association for Computing Machinery",

address = "United States",

note = "Eighth ACM SIGSPATIAL International Workshop on Indoor Spatial Awareness, ISA '16 ; Conference date: 31-10-2016 Through 03-11-2016",

url = "https://sites.google.com/site/indoorspatialawareness2016/",

}

Jensen, SK, Nielsen, JTV, Lu, H & Cheema, MA 2016, Outdoor-indoor Space: Unified Modeling and Shortest Path Search. in M Aamir Cheema, M Eunus Ali & S Yang (eds), Proceedings of the Eighth ACM SIGSPATIAL International Workshop on Indoor Spatial Awareness. Association for Computing Machinery, pp. 35-42, Eighth ACM SIGSPATIAL International Workshop on Indoor Spatial Awareness, California, United States, 31/10/2016. https://doi.org/10.1145/3005422.3005427

Outdoor-indoor Space: Unified Modeling and Shortest Path Search. / Jensen, Søren Kejser; Nielsen, Jens Thomas Vejlby; Lu, Hua et al.
Proceedings of the Eighth ACM SIGSPATIAL International Workshop on Indoor Spatial Awareness. ed. / Muhammad Aamir Cheema; Mohammed Eunus Ali; Shiyu Yang. Association for Computing Machinery, 2016. p. 35-42.

Research output: Contribution to book/anthology/report/conference proceeding › Article in proceeding › Research › peer-review

TY - GEN

T1 - Outdoor-indoor Space

T2 - Eighth ACM SIGSPATIAL International Workshop on Indoor Spatial Awareness

AU - Jensen, Søren Kejser

AU - Nielsen, Jens Thomas Vejlby

AU - Lu, Hua

AU - Cheema, Muhammad Aamir

PY - 2016/10/31

Y1 - 2016/10/31

N2 - Graph models are widely used for representing the topology of outdoor space (O-Space) and indoor space (I-Space). However, existing models neglect the intersection between O-Space and I-Space, only allowing for computations such as shortest path and nearest neighbor queries in either O-Space or I-Space, separately. In this paper, we present two different outdoor-indoor space (OI-Space) models allowing queries to operate on a mix of both spaces. The first model keeps the distinct nature of the two spaces intact by having explicit connections between outdoor and indoor spaces. The second model abstracts this distinction away, and provides a unified model of outdoor-indoor space. For each model, we present an algorithm that is able to span the two types of spaces to return the real shortest path between two arbitrary points. The experimental evaluations show that the proposed models and algorithms perform well enough to be usable in practice.

AB - Graph models are widely used for representing the topology of outdoor space (O-Space) and indoor space (I-Space). However, existing models neglect the intersection between O-Space and I-Space, only allowing for computations such as shortest path and nearest neighbor queries in either O-Space or I-Space, separately. In this paper, we present two different outdoor-indoor space (OI-Space) models allowing queries to operate on a mix of both spaces. The first model keeps the distinct nature of the two spaces intact by having explicit connections between outdoor and indoor spaces. The second model abstracts this distinction away, and provides a unified model of outdoor-indoor space. For each model, we present an algorithm that is able to span the two types of spaces to return the real shortest path between two arbitrary points. The experimental evaluations show that the proposed models and algorithms perform well enough to be usable in practice.

KW - modeling outdoor-indoor space, shortest path search in outdoor-indoor space

U2 - 10.1145/3005422.3005427

DO - 10.1145/3005422.3005427

M3 - Article in proceeding

SP - 35

EP - 42

BT - Proceedings of the Eighth ACM SIGSPATIAL International Workshop on Indoor Spatial Awareness

A2 - Aamir Cheema, Muhammad

A2 - Eunus Ali, Mohammed

A2 - Yang, Shiyu

PB - Association for Computing Machinery

Y2 - 31 October 2016 through 3 November 2016

ER -

Outdoor-indoor Space: Unified Modeling and Shortest Path Search

Abstract

Workshop

Keywords

Access to Document

AUB Link

Fingerprint

Cite this