Scalable Exact Visualization of Isocontours in Road Networks via Minimum-Link Paths

Medientyp: E-Artikel; Elektronischer Konferenzbericht; Sonstige Veröffentlichung

Titel: Scalable Exact Visualization of Isocontours in Road Networks via Minimum-Link Paths

Beteiligte: Baum, Moritz [VerfasserIn]; Bläsius, Thomas [VerfasserIn]; Gemsa, Andreas [VerfasserIn]; Rutter, Ignaz [VerfasserIn]; Wegner, Franziska [VerfasserIn]

Erschienen: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2016

Sprache: Englisch

DOI: https://doi.org/10.4230/LIPIcs.ESA.2016.7

Schlagwörter: minimum-link paths ; separating polygons ; isocontours

Entstehung:

Anmerkungen: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.

Beschreibung: Isocontours in road networks represent the area that is reachable from a source within a given resource limit. We study the problem of computing accurate isocontours in realistic, large-scale networks. We propose isocontours represented by polygons with minimum number of segments that separate reachable and unreachable components of the network. Since the resulting problem is not known to be solvable in polynomial time, we introduce several heuristics that run in (almost) linear time and are simple enough to be implemented in practice. A key ingredient is a new practical linear-time algorithm for minimum-link paths in simple polygons. Experiments in a challenging realistic setting show excellent performance of our algorithms in practice, computing near-optimal solutions in a few milliseconds on average, even for long ranges.

Zugangsstatus: Freier Zugang

Nur in Feld suchen:

Zuletzt gesuchte Begriffe: