2026-07-20T04:49:00Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6349 2024-03-06T10:38:03Z ddc:004 open_access

Scalable Exact Visualization of Isocontours in Road Networks via Minimum-Link Paths Baum, Moritz Bläsius, Thomas Gemsa, Andreas Rutter, Ignaz Wegner, Franziska isocontours separating polygons minimum-link paths 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Moritz Baum and Thomas Bläsius and Andreas Gemsa and Ignaz Rutter and Franziska Wegner 2016 Is Part Of LIPIcs, Volume 57, 24th Annual European Symposium on Algorithms (ESA 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ESA.2016.7 urn:nbn:de:0030-drops-63498 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.7 eng https://creativecommons.org/licenses/by/3.0/legalcode