Given trajectory data with gaps, we investigate methods to identify possible rendezvous regions. Societal applications include improving maritime safety and regulations. The challenges come from two aspects. If trajectory data are not available round the rendezvous then either linear or shortest-path interpolation may fail to detect the possible rendezvous. Furthermore, the problem is computationally expensive due to the large number of gaps and associated trajectories. In this paper, we first use the plane sweep algorithm as a baseline. Then we propose a new filtering framework using the concept of a space-time grid. Experimental results and case study on real-world maritime trajectory data show that the proposed approach substantially improves the Area Pruning Efficiency over the baseline technique.
|Original language||English (US)|
|Title of host publication||11th International Conference on Geographic Information Science, GIScience 2021|
|Editors||Krzysztof Janowicz, Judith A. Verstegen|
|Publisher||Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing|
|State||Published - Sep 1 2020|
|Event||11th International Conference on Geographic Information Science, GIScience 2021 - Poznan, Poland|
Duration: Sep 27 2021 → Sep 30 2021
|Name||Leibniz International Proceedings in Informatics, LIPIcs|
|Conference||11th International Conference on Geographic Information Science, GIScience 2021|
|Period||9/27/21 → 9/30/21|
Bibliographical noteFunding Information:
Funding This material is based upon work supported by the US Department Of Defense Grant No. HM04762010009 and National Science Foundation under Grants No. 1737633.
© LIPIcs 2020.
- Spatial data mining
- time geography
- trajectory mining