Volume
LIPIcs, Volume 208
11th International Conference on Geographic Information Science (GIScience 2021) - Part II
Publication Details
- published at: 2021-09-14
- Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
- ISBN: 978-3-95977-208-2
- DBLP: db/conf/giscience/giscience2021-2
Access Numbers
- Detailed Access Statistics available here
-
Total Document Accesses (updated on a weekly basis):
0PDF Downloads
Documents
No documents found matching your filter selection.
Document
Complete Volume
LIPIcs, Volume 208, GIScience 2021, Complete Volume
Abstract
LIPIcs, Volume 208, GIScience 2021, Complete Volume
Cite as
11th International Conference on Geographic Information Science (GIScience 2021) - Part II. Leibniz International Proceedings in Informatics (LIPIcs), Volume 208, pp. 1-224, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
Copy BibTex To Clipboard
@Proceedings{janowicz_et_al:LIPIcs.GIScience.2021.II,
title = {{LIPIcs, Volume 208, GIScience 2021, Complete Volume}},
booktitle = {11th International Conference on Geographic Information Science (GIScience 2021) - Part II},
pages = {1--224},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-208-2},
ISSN = {1868-8969},
year = {2021},
volume = {208},
editor = {Janowicz, Krzysztof and Verstegen, Judith A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GIScience.2021.II},
URN = {urn:nbn:de:0030-drops-147585},
doi = {10.4230/LIPIcs.GIScience.2021.II},
annote = {Keywords: LIPIcs, Volume 208, GIScience 2021, Complete Volume}
}
Document
Front Matter
Front Matter, Table of Contents, Preface, Conference Organization
Abstract
Front Matter, Table of Contents, Preface, Conference Organization
Cite as
11th International Conference on Geographic Information Science (GIScience 2021) - Part II. Leibniz International Proceedings in Informatics (LIPIcs), Volume 208, pp. 0:i-0:xiv, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
Copy BibTex To Clipboard
@InProceedings{janowicz_et_al:LIPIcs.GIScience.2021.II.0,
author = {Janowicz, Krzysztof and Verstegen, Judith A.},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {11th International Conference on Geographic Information Science (GIScience 2021) - Part II},
pages = {0:i--0:xiv},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-208-2},
ISSN = {1868-8969},
year = {2021},
volume = {208},
editor = {Janowicz, Krzysztof and Verstegen, Judith A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GIScience.2021.II.0},
URN = {urn:nbn:de:0030-drops-147593},
doi = {10.4230/LIPIcs.GIScience.2021.II.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
Document
Adaptive Voronoi Masking: A Method to Protect Confidential Discrete Spatial Data
Abstract
Geomasks assure the protection of individuals in a discrete spatial point data set by aggregating, transferring or altering original points. This study develops an alternative approach, referred to as Adaptive Voronoi Masking (AVM), which is based on the concepts of Adaptive Aerial Elimination (AAE) and Voronoi Masking (VM). It considers the underlying population density by establishing areas of K-anonymity in which Voronoi polygons are created. Contrary to other geomasks, AVM considers the underlying topography and displaces data points to street intersections thus decreasing the risk of false-identification since residences are not endowed with a data point.
The geomasking effects of AVM are examined by various spatial analytical results and are compared with the outputs of AAE, VM, and Donut Masking (DM). VM attains the best efficiency for the mean centres whereas DM does for the median centres. Regarding the Nearest Neighbour Hierarchical Cluster Analysis and Ripley’s K-function, DM demonstrates the strongest performance since its cluster ellipsoids and clustering distance are the most similar to those of the original data. The extend of the original data is preserved the most by VM, while AVM retains the topology of the point pattern. Overall, AVM was ranked as 2nd in terms of data utility (i) and also outperforms all methods regarding the risk of false re-identification (ii) because no data point is moved to a residence. Furthermore, AVM maintains the Spatial K-anonymity (iii) which is also done by AAE and partly by DM. Based on the performance combination of these factors, AVM is an advantageous technique to mask geodata.
Cite as
Fiona Polzin and Ourania Kounadi. Adaptive Voronoi Masking: A Method to Protect Confidential Discrete Spatial Data. In 11th International Conference on Geographic Information Science (GIScience 2021) - Part II. Leibniz International Proceedings in Informatics (LIPIcs), Volume 208, pp. 1:1-1:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
Copy BibTex To Clipboard
@InProceedings{polzin_et_al:LIPIcs.GIScience.2021.II.1,
author = {Polzin, Fiona and Kounadi, Ourania},
title = {{Adaptive Voronoi Masking: A Method to Protect Confidential Discrete Spatial Data}},
booktitle = {11th International Conference on Geographic Information Science (GIScience 2021) - Part II},
pages = {1:1--1:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-208-2},
ISSN = {1868-8969},
year = {2021},
volume = {208},
editor = {Janowicz, Krzysztof and Verstegen, Judith A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GIScience.2021.II.1},
URN = {urn:nbn:de:0030-drops-147606},
doi = {10.4230/LIPIcs.GIScience.2021.II.1},
annote = {Keywords: Geoprivacy, location privacy, geomasking, Adaptive Voronoi Masking, Voronoi Masking, Adaptive Aerial Elimination, Donut Geomasking, ESDA}
}
Document
Reproducible Research and GIScience: An Evaluation Using GIScience Conference Papers
Abstract
GIScience conference authors and researchers face the same computational reproducibility challenges as authors and researchers from other disciplines who use computers to analyse data. Here, to assess the reproducibility of GIScience research, we apply a rubric for assessing the reproducibility of 75 conference papers published at the GIScience conference series in the years 2012-2018. Since the rubric and process were previously applied to the publications of the AGILE conference series, this paper itself is an attempt to replicate that analysis, however going beyond the previous work by evaluating and discussing proposed measures to improve reproducibility in the specific context of the GIScience conference series. The results of the GIScience paper assessment are in line with previous findings: although descriptions of workflows and the inclusion of the data and software suffice to explain the presented work, in most published papers they do not allow a third party to reproduce the results and findings with a reasonable effort. We summarise and adapt previous recommendations for improving this situation and propose the GIScience community to start a broad discussion on the reusability, quality, and openness of its research. Further, we critically reflect on the process of assessing paper reproducibility, and provide suggestions for improving future assessments. The code and data for this article are published at https://doi.org/10.5281/zenodo.4032875.
Cite as
Frank O. Ostermann, Daniel Nüst, Carlos Granell, Barbara Hofer, and Markus Konkol. Reproducible Research and GIScience: An Evaluation Using GIScience Conference Papers. In 11th International Conference on Geographic Information Science (GIScience 2021) - Part II. Leibniz International Proceedings in Informatics (LIPIcs), Volume 208, pp. 2:1-2:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
Copy BibTex To Clipboard
@InProceedings{ostermann_et_al:LIPIcs.GIScience.2021.II.2,
author = {Ostermann, Frank O. and N\"{u}st, Daniel and Granell, Carlos and Hofer, Barbara and Konkol, Markus},
title = {{Reproducible Research and GIScience: An Evaluation Using GIScience Conference Papers}},
booktitle = {11th International Conference on Geographic Information Science (GIScience 2021) - Part II},
pages = {2:1--2:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-208-2},
ISSN = {1868-8969},
year = {2021},
volume = {208},
editor = {Janowicz, Krzysztof and Verstegen, Judith A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GIScience.2021.II.2},
URN = {urn:nbn:de:0030-drops-147615},
doi = {10.4230/LIPIcs.GIScience.2021.II.2},
annote = {Keywords: reproducible research, open science, reproducibility, GIScience}
}
Document
Comparison of Simulated Fast and Green Routes for Cyclists and Pedestrians
Abstract
Routes with a high share of greenery are attractive for cyclist and pedestrians. We analyze how strongly such green routes differ from the respective fast routes using the openrouteservice. Greenness of streets was estimated based on OpenStreetMap data in combination with Sentinel-II imagery, 3d laser scan data and administrative information on trees on public ground. We assess the effect both at the level of the individual route and at the urban level for two German cities: Dresden and Heidelberg. For individual routes, we study how strongly green routes differ from the respective fast routes. In addition, we identify parts of the road network which represent important green corridors as well as unattractive parts which can or cannot be avoided at the cost of reasonable detours. In both cities, our results show the importance of urban green spaces for the provision of attractive green routes and provide new insights for urban planning by identifying unvegetated bottlenecks in the street network for which no green alternatives exist at this point.
Cite as
Christina Ludwig, Sven Lautenbach, Eva-Marie Schömann, and Alexander Zipf. Comparison of Simulated Fast and Green Routes for Cyclists and Pedestrians. In 11th International Conference on Geographic Information Science (GIScience 2021) - Part II. Leibniz International Proceedings in Informatics (LIPIcs), Volume 208, pp. 3:1-3:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
Copy BibTex To Clipboard
@InProceedings{ludwig_et_al:LIPIcs.GIScience.2021.II.3,
author = {Ludwig, Christina and Lautenbach, Sven and Sch\"{o}mann, Eva-Marie and Zipf, Alexander},
title = {{Comparison of Simulated Fast and Green Routes for Cyclists and Pedestrians}},
booktitle = {11th International Conference on Geographic Information Science (GIScience 2021) - Part II},
pages = {3:1--3:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-208-2},
ISSN = {1868-8969},
year = {2021},
volume = {208},
editor = {Janowicz, Krzysztof and Verstegen, Judith A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GIScience.2021.II.3},
URN = {urn:nbn:de:0030-drops-147622},
doi = {10.4230/LIPIcs.GIScience.2021.II.3},
annote = {Keywords: Routing, OpenStreetMap, route choice, urban vegetation, sustainable mobility}
}
Document
A Clustering-Based Framework for Individual Travel Behaviour Change Detection
Abstract
The emergence of passively and continuously recorded movement data offers new opportunities to study the long-term change of individual travel behaviour from data-driven perspectives. This study proposes a clustering-based framework to identify travel behaviour patterns and detect potential change periods on the individual level. First, we extract important trips that depict individual characteristic movement. Then, considering trip mode, trip distance, and trip duration as travel behaviour dimensions, we measure the similarities of trips and group them into clusters using hierarchical clustering. The trip clusters represent dimensions of travel behaviours, and the change of their relative proportions over time reflect the development of travel preferences. We use two different methods to detect changes in travel behaviour patterns: the Herfindahl-Hirschman index-based method and the sliding window-based method. The framework is tested using data from a large-scale longitudinal GPS tracking data study in which participants had access to a Mobility-as-a-Service (MaaS) offer. The methods successfully identify significant travel behaviour changes for users. Moreover, we analyse the impact of the MaaS offer on individual travel behaviours with the obtained change information. The proposed framework for behaviour change detection provides valuable insights for travel demand management and evaluating people’s reactions to sustainable mobility options.
Cite as
Ye Hong, Yanan Xin, Henry Martin, Dominik Bucher, and Martin Raubal. A Clustering-Based Framework for Individual Travel Behaviour Change Detection. In 11th International Conference on Geographic Information Science (GIScience 2021) - Part II. Leibniz International Proceedings in Informatics (LIPIcs), Volume 208, pp. 4:1-4:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
Copy BibTex To Clipboard
@InProceedings{hong_et_al:LIPIcs.GIScience.2021.II.4,
author = {Hong, Ye and Xin, Yanan and Martin, Henry and Bucher, Dominik and Raubal, Martin},
title = {{A Clustering-Based Framework for Individual Travel Behaviour Change Detection}},
booktitle = {11th International Conference on Geographic Information Science (GIScience 2021) - Part II},
pages = {4:1--4:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-208-2},
ISSN = {1868-8969},
year = {2021},
volume = {208},
editor = {Janowicz, Krzysztof and Verstegen, Judith A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GIScience.2021.II.4},
URN = {urn:nbn:de:0030-drops-147635},
doi = {10.4230/LIPIcs.GIScience.2021.II.4},
annote = {Keywords: Human mobility, Travel behaviour, Change detection, Trip clustering}
}
Document
Will You Take This Turn? Gaze-Based Turning Activity Recognition During Navigation
Abstract
Decision making is an integral part of wayfinding and people progressively use navigation systems to facilitate this task. The primary decision, which is also the main source of navigation error, is about the turning activity, i.e., to decide either to turn left or right or continue straight forward. The fundamental step to deal with this error, before applying any preventive approaches, e.g., providing more information, or any compensatory solutions, e.g., pre-calculating alternative routes, could be to predict and recognize the potential turning activity. This paper aims to address this step by predicting the turning decision of pedestrian wayfinders, before the actual action takes place, using primarily gaze-based features. Applying Machine Learning methods, the results of the presented experiment demonstrate an overall accuracy of 91% within three seconds before arriving at a decision point. Beyond the application perspective, our findings also shed light on the cognitive processes of decision making as reflected by the wayfinder’s gaze behaviour: incorporating environmental and user-related factors to the model, results in a noticeable change with respect to the importance of visual search features in turn activity recognition.
Cite as
Negar Alinaghi, Markus Kattenbeck, Antonia Golab, and Ioannis Giannopoulos. Will You Take This Turn? Gaze-Based Turning Activity Recognition During Navigation. In 11th International Conference on Geographic Information Science (GIScience 2021) - Part II. Leibniz International Proceedings in Informatics (LIPIcs), Volume 208, pp. 5:1-5:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
Copy BibTex To Clipboard
@InProceedings{alinaghi_et_al:LIPIcs.GIScience.2021.II.5,
author = {Alinaghi, Negar and Kattenbeck, Markus and Golab, Antonia and Giannopoulos, Ioannis},
title = {{Will You Take This Turn? Gaze-Based Turning Activity Recognition During Navigation}},
booktitle = {11th International Conference on Geographic Information Science (GIScience 2021) - Part II},
pages = {5:1--5:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-208-2},
ISSN = {1868-8969},
year = {2021},
volume = {208},
editor = {Janowicz, Krzysztof and Verstegen, Judith A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GIScience.2021.II.5},
URN = {urn:nbn:de:0030-drops-147649},
doi = {10.4230/LIPIcs.GIScience.2021.II.5},
annote = {Keywords: Activity Recognition, Wayfinding, Eye Tracking, Machine Learning}
}
Document
Bicriteria Aggregation of Polygons via Graph Cuts
Abstract
We present a new method for the task of detecting groups of polygons in a given geographic data set and computing a representative polygon for each group. This task is relevant in map generalization where the aim is to derive a less detailed map from a given map. Following a classical approach, we define the output polygons by merging the input polygons with a set of triangles that we select from a constrained Delaunay triangulation of the input polygons' exterior. The innovation of our method is to compute the selection of triangles by solving a bicriteria optimization problem. While on the one hand we aim at minimizing the total area of the outputs polygons, we aim on the other hand at minimizing their total perimeter. We combine these two objectives in a weighted sum and study two computational problems that naturally arise. In the first problem, the parameter that balances the two objectives is fixed and the aim is to compute a single optimal solution. In the second problem, the aim is to compute a set containing an optimal solution for every possible value of the parameter. We present efficient algorithms for these problems based on computing a minimum cut in an appropriately defined graph. Moreover, we show how the result set of the second problem can be approximated with few solutions. In an experimental evaluation, we finally show that the method is able to derive settlement areas from building footprints that are similar to reference solutions.
Cite as
Peter Rottmann, Anne Driemel, Herman Haverkort, Heiko Röglin, and Jan-Henrik Haunert. Bicriteria Aggregation of Polygons via Graph Cuts. In 11th International Conference on Geographic Information Science (GIScience 2021) - Part II. Leibniz International Proceedings in Informatics (LIPIcs), Volume 208, pp. 6:1-6:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
Copy BibTex To Clipboard
@InProceedings{rottmann_et_al:LIPIcs.GIScience.2021.II.6,
author = {Rottmann, Peter and Driemel, Anne and Haverkort, Herman and R\"{o}glin, Heiko and Haunert, Jan-Henrik},
title = {{Bicriteria Aggregation of Polygons via Graph Cuts}},
booktitle = {11th International Conference on Geographic Information Science (GIScience 2021) - Part II},
pages = {6:1--6:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-208-2},
ISSN = {1868-8969},
year = {2021},
volume = {208},
editor = {Janowicz, Krzysztof and Verstegen, Judith A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GIScience.2021.II.6},
URN = {urn:nbn:de:0030-drops-147658},
doi = {10.4230/LIPIcs.GIScience.2021.II.6},
annote = {Keywords: map generalization, aggregation, graph cuts, bicriteria optimization}
}
Document
Coordinated Schematization for Visualizing Mobility Patterns on Networks
Abstract
GPS trajectories of vehicles moving on a road network are a valuable source of traffic information. However, the sheer volume of available data makes it challenging to identify and visualize salient patterns. Meaningful visual summaries of trajectory collections require that both the trajectories and the underlying network are aggregated and simplified in a coherent manner. In this paper we propose a coordinated fully-automated pipeline for computing a schematic overview of mobility patterns from a collection of trajectories on a street network. Our pipeline utilizes well-known building blocks from GIS, automated cartography, and trajectory analysis: map matching, road selection, schematization, movement patterns, and metro-map style rendering. We showcase the results of our pipeline on two real-world trajectory collections around The Hague and Beijing.
Cite as
Bram Custers, Wouter Meulemans, Bettina Speckmann, and Kevin Verbeek. Coordinated Schematization for Visualizing Mobility Patterns on Networks. In 11th International Conference on Geographic Information Science (GIScience 2021) - Part II. Leibniz International Proceedings in Informatics (LIPIcs), Volume 208, pp. 7:1-7:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
Copy BibTex To Clipboard
@InProceedings{custers_et_al:LIPIcs.GIScience.2021.II.7,
author = {Custers, Bram and Meulemans, Wouter and Speckmann, Bettina and Verbeek, Kevin},
title = {{Coordinated Schematization for Visualizing Mobility Patterns on Networks}},
booktitle = {11th International Conference on Geographic Information Science (GIScience 2021) - Part II},
pages = {7:1--7:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-208-2},
ISSN = {1868-8969},
year = {2021},
volume = {208},
editor = {Janowicz, Krzysztof and Verstegen, Judith A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GIScience.2021.II.7},
URN = {urn:nbn:de:0030-drops-147665},
doi = {10.4230/LIPIcs.GIScience.2021.II.7},
annote = {Keywords: Trajectories, Visualization, Schematization}
}
Document
Harmonious Simplification of Isolines
Abstract
Current techniques for simplification focus on reducing complexity while maintaining the geometric similarity to the input. For isolines that jointly describe a scalar field, however, we postulate that geometric similarity of each isoline separately is not sufficient. Rather, we need to maintain the harmony between these isolines to make them visually relate and describe the structures of the underlying terrain. Based on principles of manual cartography, we propose an algorithm for simplifying isolines while considering harmony explicitly. Our preliminary visual and quantitative results suggest that our algorithm is effective.
Cite as
Arthur van Goethem, Wouter Meulemans, Andreas Reimer, and Bettina Speckmann. Harmonious Simplification of Isolines. In 11th International Conference on Geographic Information Science (GIScience 2021) - Part II. Leibniz International Proceedings in Informatics (LIPIcs), Volume 208, pp. 8:1-8:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
Copy BibTex To Clipboard
@InProceedings{vangoethem_et_al:LIPIcs.GIScience.2021.II.8,
author = {van Goethem, Arthur and Meulemans, Wouter and Reimer, Andreas and Speckmann, Bettina},
title = {{Harmonious Simplification of Isolines}},
booktitle = {11th International Conference on Geographic Information Science (GIScience 2021) - Part II},
pages = {8:1--8:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-208-2},
ISSN = {1868-8969},
year = {2021},
volume = {208},
editor = {Janowicz, Krzysztof and Verstegen, Judith A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GIScience.2021.II.8},
URN = {urn:nbn:de:0030-drops-147675},
doi = {10.4230/LIPIcs.GIScience.2021.II.8},
annote = {Keywords: Simplification, isolines, harmony}
}
Document
Navigating Your Way! Increasing the Freedom of Choice During Wayfinding
Abstract
Using navigation assistance systems has become widespread and scholars have tried to mitigate potentially adverse effects on spatial cognition these systems may have due to the division of attention they require. In order to nudge the user to engage more with the environment, we propose a novel navigation paradigm called Free Choice Navigation balancing the number of free choices, route length and number of instructions given. We test the viability of this approach by means of an agent-based simulation for three different cities. Environmental spatial abilities and spatial confidence are the two most important modeled features of our agents. Our results are very promising: Agents could decide freely at more than 50% of all junctions. More than 90% of the agents reached their destination within an average distance of about 125% shortest path length.
Cite as
Bartosz Mazurkiewicz, Markus Kattenbeck, and Ioannis Giannopoulos. Navigating Your Way! Increasing the Freedom of Choice During Wayfinding. In 11th International Conference on Geographic Information Science (GIScience 2021) - Part II. Leibniz International Proceedings in Informatics (LIPIcs), Volume 208, pp. 9:1-9:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
Copy BibTex To Clipboard
@InProceedings{mazurkiewicz_et_al:LIPIcs.GIScience.2021.II.9,
author = {Mazurkiewicz, Bartosz and Kattenbeck, Markus and Giannopoulos, Ioannis},
title = {{Navigating Your Way! Increasing the Freedom of Choice During Wayfinding}},
booktitle = {11th International Conference on Geographic Information Science (GIScience 2021) - Part II},
pages = {9:1--9:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-208-2},
ISSN = {1868-8969},
year = {2021},
volume = {208},
editor = {Janowicz, Krzysztof and Verstegen, Judith A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GIScience.2021.II.9},
URN = {urn:nbn:de:0030-drops-147680},
doi = {10.4230/LIPIcs.GIScience.2021.II.9},
annote = {Keywords: Agent-based Simulation, Wayfinding, Free Choice Navigation}
}
Document
Terrain Prickliness: Theoretical Grounds for High Complexity Viewsheds
Abstract
An important task in terrain analysis is computing viewsheds. A viewshed is the union of all the parts of the terrain that are visible from a given viewpoint or set of viewpoints. The complexity of a viewshed can vary significantly depending on the terrain topography and the viewpoint position.
In this work we study a new topographic attribute, the prickliness, that measures the number of local maxima in a terrain from all possible angles of view. We show that the prickliness effectively captures the potential of terrains to have high complexity viewsheds. We present near-optimal algorithms to compute it for TIN terrains, and efficient approximate algorithms for raster DEMs. We validate the usefulness of the prickliness attribute with experiments in a large set of real terrains.
Cite as
Ankush Acharyya, Ramesh K. Jallu, Maarten Löffler, Gert G.T. Meijer, Maria Saumell, Rodrigo I. Silveira, and Frank Staals. Terrain Prickliness: Theoretical Grounds for High Complexity Viewsheds. In 11th International Conference on Geographic Information Science (GIScience 2021) - Part II. Leibniz International Proceedings in Informatics (LIPIcs), Volume 208, pp. 10:1-10:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
Copy BibTex To Clipboard
@InProceedings{acharyya_et_al:LIPIcs.GIScience.2021.II.10,
author = {Acharyya, Ankush and Jallu, Ramesh K. and L\"{o}ffler, Maarten and Meijer, Gert G.T. and Saumell, Maria and Silveira, Rodrigo I. and Staals, Frank},
title = {{Terrain Prickliness: Theoretical Grounds for High Complexity Viewsheds}},
booktitle = {11th International Conference on Geographic Information Science (GIScience 2021) - Part II},
pages = {10:1--10:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-208-2},
ISSN = {1868-8969},
year = {2021},
volume = {208},
editor = {Janowicz, Krzysztof and Verstegen, Judith A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GIScience.2021.II.10},
URN = {urn:nbn:de:0030-drops-147697},
doi = {10.4230/LIPIcs.GIScience.2021.II.10},
annote = {Keywords: Digital elevation model, Triangulated irregular network, Viewshed complexity}
}
Document
User Preferences and the Shortest Path
Abstract
Indoor navigation systems leverage shortest path algorithms to calculate routes. In order to define the "shortest path", a cost function has to be specified based on theories and heuristics in the application domain. For the domain of indoor routing, we survey theories and criteria identified in the literature as essential for human path planning. We drive quantitative definitions and integrate them into a cost function that weights each of the criteria separately. We then apply an exhaustive grid search to find weights that lead to an ideal cost function. "Ideal" here is defined as guiding the algorithm to plan routes that are most similar to those chosen by humans. To explore which criteria should be taken into account in an improved pathfinding algorithm, eleven different factors whose favorable impact on route selection has been established in past research were considered. Each factor was included separately in the Dijkstra algorithm and the similarity of thus calculated routes to the actual routes chosen by students at the University of Regensburg was determined. This allows for a quantitative assessment of the factors’ impact and further constitutes a way to directly compare them. A reduction of the number of turns, streets, revolving doors, entryways, elevators as well as the combination of the aforementioned factors was found to have a positive effect and generate paths that were favored over the shortest path. Turns and the combination of criteria turned out to be most impactful.
Cite as
Isabella Kreller and Bernd Ludwig. User Preferences and the Shortest Path. In 11th International Conference on Geographic Information Science (GIScience 2021) - Part II. Leibniz International Proceedings in Informatics (LIPIcs), Volume 208, pp. 11:1-11:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
Copy BibTex To Clipboard
@InProceedings{kreller_et_al:LIPIcs.GIScience.2021.II.11,
author = {Kreller, Isabella and Ludwig, Bernd},
title = {{User Preferences and the Shortest Path}},
booktitle = {11th International Conference on Geographic Information Science (GIScience 2021) - Part II},
pages = {11:1--11:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-208-2},
ISSN = {1868-8969},
year = {2021},
volume = {208},
editor = {Janowicz, Krzysztof and Verstegen, Judith A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GIScience.2021.II.11},
URN = {urn:nbn:de:0030-drops-147700},
doi = {10.4230/LIPIcs.GIScience.2021.II.11},
annote = {Keywords: Pedestrian Navigation Systems, Wayfinding, Computation of Optimal Paths, User Preferences for Best Routes}
}
Document
Map Matching for Semi-Restricted Trajectories
Abstract
We consider the problem of matching trajectories to a road map, giving particular consideration to trajectories that do not exclusively follow the underlying network. Such trajectories arise, for example, when a person walks through the inner part of a city, crossing market squares or parking lots. We call such trajectories semi-restricted. Sensible map matching of semi-restricted trajectories requires the ability to differentiate between restricted and unrestricted movement. We develop in this paper an approach that efficiently and reliably computes concise representations of such trajectories that maintain their semantic characteristics. Our approach utilizes OpenStreetMap data to not only extract the network but also areas that allow for free movement (as e.g. parks) as well as obstacles (as e.g. buildings). We discuss in detail how to incorporate this information in the map matching process, and demonstrate the applicability of our method in an experimental evaluation on real pedestrian and bicycle trajectories.
Cite as
Timon Behr, Thomas C. van Dijk, Axel Forsch, Jan-Henrik Haunert, and Sabine Storandt. Map Matching for Semi-Restricted Trajectories. In 11th International Conference on Geographic Information Science (GIScience 2021) - Part II. Leibniz International Proceedings in Informatics (LIPIcs), Volume 208, pp. 12:1-12:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
Copy BibTex To Clipboard
@InProceedings{behr_et_al:LIPIcs.GIScience.2021.II.12,
author = {Behr, Timon and van Dijk, Thomas C. and Forsch, Axel and Haunert, Jan-Henrik and Storandt, Sabine},
title = {{Map Matching for Semi-Restricted Trajectories}},
booktitle = {11th International Conference on Geographic Information Science (GIScience 2021) - Part II},
pages = {12:1--12:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-208-2},
ISSN = {1868-8969},
year = {2021},
volume = {208},
editor = {Janowicz, Krzysztof and Verstegen, Judith A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GIScience.2021.II.12},
URN = {urn:nbn:de:0030-drops-147717},
doi = {10.4230/LIPIcs.GIScience.2021.II.12},
annote = {Keywords: map matching, OpenStreetMap, GPS, trajectory, road network}
}
Document
Automated Georeferencing of Antarctic Species
Abstract
Many text documents in the biological domain contain references to the toponym of specific phenomena (e.g. species sightings) in natural language form "In <LOCATION> Garwood Valley summer activity was 0.2% for <SPECIES> Umbilicaria aprina and 1.7% for <SPECIES> Caloplaca sp. ..."
While methods have been developed to extract place names from documents, and attention has been given to the interpretation of spatial prepositions, the ability to connect toponym mentions in text with the phenomena to which they refer (in this case species) has been given limited attention, but would be of considerable benefit for the task of mapping specific phenomena mentioned in text documents.
As part of work to create a pipeline to automate georeferencing of species within legacy documents, this paper proposes a method to: (1) recognise species and toponyms within text and (2) match each species mention to the relevant toponym mention. Our methods find significant promise in a bespoke rules- and dictionary-based approach to recognise species within text (F1 scores up to 0.87 including partial matches) but less success, as yet, recognising toponyms using multiple gazetteers combined with an off the shelf natural language processing tool (F1 up to 0.62).
Most importantly, we offer a contribution to the relatively nascent area of matching toponym references to the object they locate (in our case species), including cases in which the toponym and species are in different sentences. We use tree-based models to achieve precision as high as 0.88 or an F1 score up to 0.68 depending on the downsampling rate. Initial results out perform previous research on detecting entity relationships that may cross sentence boundaries within biomedical text, and differ from previous work in specifically addressing species mapping.
Cite as
Jamie Scott, Kristin Stock, Fraser Morgan, Brandon Whitehead, and David Medyckyj-Scott. Automated Georeferencing of Antarctic Species. In 11th International Conference on Geographic Information Science (GIScience 2021) - Part II. Leibniz International Proceedings in Informatics (LIPIcs), Volume 208, pp. 13:1-13:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
Copy BibTex To Clipboard
@InProceedings{scott_et_al:LIPIcs.GIScience.2021.II.13,
author = {Scott, Jamie and Stock, Kristin and Morgan, Fraser and Whitehead, Brandon and Medyckyj-Scott, David},
title = {{Automated Georeferencing of Antarctic Species}},
booktitle = {11th International Conference on Geographic Information Science (GIScience 2021) - Part II},
pages = {13:1--13:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-208-2},
ISSN = {1868-8969},
year = {2021},
volume = {208},
editor = {Janowicz, Krzysztof and Verstegen, Judith A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GIScience.2021.II.13},
URN = {urn:nbn:de:0030-drops-147726},
doi = {10.4230/LIPIcs.GIScience.2021.II.13},
annote = {Keywords: Named Entity Recognition (NER), Taxonomic Name Extraction, Relation Extraction, Georeferencing}
}