%0 Conference Paper %1 DBLP:conf/w2gis/StankovS20 %A Stankov, Toni %A Storandt, Sabine %B Web and Wireless Geographical Information Systems - 18th International Symposium, W2GIS 2020, Wuhan, China, November 13-14, 2020, Proceedings %D 2020 %K 2020 b06 sfbtrr161 %P 181--196 %R 10.1007/978-3-030-60952-8\_19 %T Maximum Gap Minimization in Polylines %U https://doi.org/10.1007/978-3-030-60952-8\_19 %X Given a polyline consisting of n segments, we study the problem of selecting k of its segments such that the maximum induced gap length without a selected segment is minimized. This optimization problem has applications in the domains of trajectory visualization and facility location. We design several heuristics and exact algorithms for simple polylines, along with algorithm engineering techniques to achieve good practical running times even for large values of n and k. The fastest exact algorithm is based on dynamic programming and exhibits a running time of O(nk) while using space linear in n. Furthermore, we consider incremental problem variants. For the case where a given set of k segments shall be augmented by a single additional segment, we devise an optimal algorithm which runs in O(k + log n) on a suitable polyline representation. If not only a single segment but k' segments shall be added, we can compute the optimal segment set in time O(nk') by modifying the dynamic programming approach for the original problem. Experiments on large sets of real-world trajectories as well as artificial polylines show the trade-offs between quality and running time of the different approaches.

@inproceedings{DBLP:conf/w2gis/StankovS20, abstract = {Given a polyline consisting of n segments, we study the problem of selecting k of its segments such that the maximum induced gap length without a selected segment is minimized. This optimization problem has applications in the domains of trajectory visualization and facility location. We design several heuristics and exact algorithms for simple polylines, along with algorithm engineering techniques to achieve good practical running times even for large values of n and k. The fastest exact algorithm is based on dynamic programming and exhibits a running time of O(nk) while using space linear in n. Furthermore, we consider incremental problem variants. For the case where a given set of k segments shall be augmented by a single additional segment, we devise an optimal algorithm which runs in O(k + log n) on a suitable polyline representation. If not only a single segment but k' segments shall be added, we can compute the optimal segment set in time O(nk') by modifying the dynamic programming approach for the original problem. Experiments on large sets of real-world trajectories as well as artificial polylines show the trade-offs between quality and running time of the different approaches.}, added-at = {2021-07-09T11:18:33.000+0200}, author = {Stankov, Toni and Storandt, Sabine}, bibsource = {dblp computer science bibliography, https://dblp.org}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/23698063a0853e8ea989dbaefeb1953a7/sfbtrr161}, booktitle = {Web and Wireless Geographical Information Systems - 18th International Symposium, W2GIS 2020, Wuhan, China, November 13-14, 2020, Proceedings}, doi = {10.1007/978-3-030-60952-8\_19}, interhash = {6983a9a7e0a142ae1c88448e528d79e5}, intrahash = {3698063a0853e8ea989dbaefeb1953a7}, keywords = {2020 b06 sfbtrr161}, pages = {181--196}, timestamp = {2022-09-08T06:48:20.000+0200}, title = {Maximum Gap Minimization in Polylines}, url = {https://doi.org/10.1007/978-3-030-60952-8\_19}, year = 2020 }