{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T06:29:59Z","timestamp":1768804199777,"version":"3.49.0"},"reference-count":26,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2022,1,18]],"date-time":"2022-01-18T00:00:00Z","timestamp":1642464000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000266","name":"National Geospatial-Intelligence Agency","doi-asserted-by":"crossref","award":["HM0476-20-1-0009"],"award-info":[{"award-number":["HM0476-20-1-0009"]}],"id":[{"id":"10.13039\/100000266","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Intell. Syst. Technol."],"published-print":{"date-parts":[[2022,6,30]]},"abstract":"<jats:p>Given trajectory data with gaps, we investigate methods to identify possible rendezvous regions. The problem has societal applications such as improving maritime safety and regulatory enforcement. The challenges come from two aspects. First, gaps in trajectory data make it difficult to identify regions where moving objects may have rendezvoused for nefarious reasons. Hence, traditional linear or shortest path interpolation methods may not be able to detect such activities, since objects in a rendezvous may have traveled away from their usual routes to meet. Second, user detecting a rendezvous regions involve a large number of gaps and associated trajectories, making the task computationally very expensive. In preliminary work, we proposed a more effective way of handling gaps and provided examples to illustrate potential rendezvous regions. In this article, we are providing detailed experiments with both synthetic and real-world data. Experiments on synthetic data show that the accuracy improved by 50 percent, which is substantial as compared to the baseline approach. In this article, we propose a refined algorithm Temporal Selection Search for finding a potential rendezvous region and finding an optimal temporal range to improve computational efficiency. We also incorporate two novel spatial filters: (i) a Static Ellipse Intersection Filter and (ii) a Dynamic Circle Intersection Spatial Filter. Both the baseline and proposed approaches account for every possible rendezvous pattern. We provide a theoretical evaluation of the algorithms correctness and completeness along with a time complexity analysis. Experimental results on synthetic and real-world maritime trajectory data show that the proposed approach substantially improves the area pruning effectiveness and computation time over the baseline technique. We also performed experiments based on accuracy and precision on synthetic dataset on both proposed and baseline techniques.<\/jats:p>","DOI":"10.1145\/3467977","type":"journal-article","created":{"date-parts":[[2022,1,18]],"date-time":"2022-01-18T15:36:16Z","timestamp":1642520176000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Analyzing Trajectory Gaps to Find Possible Rendezvous Region"],"prefix":"10.1145","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6908-6960","authenticated-orcid":false,"given":"Arun","family":"Sharma","sequence":"first","affiliation":[{"name":"University of Minnesota, Twin Cities, Minneapolis, Minnesota, USA"}]},{"given":"Shashi","family":"Shekhar","sequence":"additional","affiliation":[{"name":"University of Minnesota, Twin Cities, Minneapolis, Minnesota, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,1,18]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/1071246.1071259"},{"key":"e_1_3_2_3_2","first-page":"109","volume-title":"Proceedings of the International Conference on GeoSensor Networks","author":"Bakalov Petko","year":"2006","unstructured":"Petko Bakalov and Vassilis J. Tsotras. 2006. Continuous spatiotemporal trajectory joins. In Proceedings of the International Conference on GeoSensor Networks. Springer, 109\u2013128."},{"key":"e_1_3_2_4_2","article-title":"MarineCadastre.gov","year":"2020","unstructured":"BOEM and NOAA. 2020. MarineCadastre.gov. Retrieved from https:\/\/marinecadastre.gov\/ais\/.","journal-title":"https:\/\/marinecadastre.gov\/ais\/"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066213"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/1653771.1653809"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497506"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIME.2008.25"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.ivs.9500182"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1015812206586"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-011-0262-6"},{"key":"e_1_3_2_12_2","doi-asserted-by":"crossref","unstructured":"Hyun-Mi Kim and Mei-Po Kwan. 2003. Space-time accessibility measures: A geocomputational algorithm with a focus on the feasible opportunity set and possible activity duration. J. Geogr. Syst. 5 (2003) 71\u201391.","DOI":"10.1007\/s101090300104"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1080\/13658810902967397"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1080\/13658810903321339"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1080\/13658816.2017.1356462"},{"key":"e_1_3_2_16_2","first-page":"267","volume-title":"Geografiska Annaler: Ser. B, Hum. Geogr.","author":"Kwan Mei-Po","year":"2004","unstructured":"Mei-Po Kwan. 2004. GIS methods in time-geographic research: Geocomputation and geovisualization of human activity patterns. Geografiska Annaler: Ser. B, Hum. Geogr. 86 (2004), 267\u2013280."},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.5555\/645921.673155"},{"key":"e_1_3_2_18_2","doi-asserted-by":"crossref","unstructured":"Harvey J. Miller. 1991. Modelling accessibility using space-time prism concepts within geographical information systems. Int. J. Geogr. Info. Sci. 5 (1991) 287\u2013301.","DOI":"10.1080\/02693799108927856"},{"key":"e_1_3_2_19_2","doi-asserted-by":"crossref","unstructured":"Tijs Neutens Tim Schwanen and Frank Witlox. 2011. The prism of everyday life: Towards a new research agenda for time geography. Transport. Rev. 31 (2011) 25\u201347.","DOI":"10.1080\/01441647.2010.484153"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.5555\/647226.719082"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.5555\/645926.672019"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137630"},{"key":"e_1_3_2_23_2","volume-title":"Proceedings of the 11th International Conference on Geographic Information Science (GIScience\u201921)","author":"Sharma Arun","year":"2020","unstructured":"Arun Sharma, Xun Tang, Jayant Gupta, Majid Farhadloo, and Shashi Shekhar. 2020. Analyzing trajectory gaps for possible rendezvous: A summary of results. In Proceedings of the 11th International Conference on Geographic Information Science (GIScience\u201921). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2651821"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2010.76"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.5555\/645483.653609"},{"key":"e_1_3_2_27_2","first-page":"1","volume-title":"ACM Trans. Intell. Syst. Technol.","author":"Zheng Yu","year":"2015","unstructured":"Yu Zheng. 2015. Trajectory data mining: An overview. ACM Trans. Intell. Syst. Technol. 6 (2015), 1\u201341."}],"container-title":["ACM Transactions on Intelligent Systems and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3467977","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3467977","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3467977","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:19:05Z","timestamp":1750191545000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3467977"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,18]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6,30]]}},"alternative-id":["10.1145\/3467977"],"URL":"https:\/\/doi.org\/10.1145\/3467977","relation":{},"ISSN":["2157-6904","2157-6912"],"issn-type":[{"value":"2157-6904","type":"print"},{"value":"2157-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,18]]},"assertion":[{"value":"2020-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-01-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}