# Towards a Tighter Bound on Possible-Rendezvous Areas: Preliminary Results

arXiv: https://arxiv.org/abs/2206.12756 · HTML: https://mlsanity.com/paper/2206.12756/

## Key facts

- Cited by 9 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 26 Jun 2022.

## Built on by (most cited first, 9 of 9)

- [Towards Kriging-informed Conditional Diffusion for Regional Sea-Level Data Downscaling](https://mlsanity.com/paper/2410.15628/) (2024)
- [Reducing False Discoveries in Statistically-Significant Regional-Colocation Mining: A Summary of Results](https://mlsanity.com/paper/2407.02536/) (2024)
- [Reducing Uncertainty in Sea-level Rise Prediction: A Spatial-variability-aware Approach](https://mlsanity.com/paper/2310.15179/) (2023)
- [Spatial Distribution-Shift Aware Knowledge-Guided Machine Learning](https://mlsanity.com/paper/2502.14840/) (2025)
- [Towards Physics-informed Diffusion for Anomaly Detection in Trajectories](https://mlsanity.com/paper/2506.06999/) (2025)
- [Towards Physics-Guided Foundation Models](https://mlsanity.com/paper/2502.15013/) (2025)
- [Physics-Guided Abnormal Trajectory Gap Detection](https://mlsanity.com/paper/2403.06268/) (2024)
- [Towards Fine-Tuning-Based Site Calibration for Knowledge-Guided Machine Learning: A Summary of Results](https://mlsanity.com/paper/2512.16013/) (2025)
- [Spatial Atlas: Compute-Grounded Reasoning for Spatial-Aware Research Agent Benchmarks](https://mlsanity.com/paper/2604.12102/) (2026)

## Abstract (arXiv)

Given trajectories with gaps, we investigate methods to tighten spatial bounds on areas (e.g., nodes in a spatial network) where possible rendezvous activity could have occurred. The problem is important for reducing the onerous amount of manual effort to post-process possible rendezvous areas using satellite imagery and has many societal applications to improve public safety, security, and health. The problem of rendezvous detection is challenging due to the difficulty of interpreting missing data within a trajectory gap and the very high cost of detecting gaps in such a large volume of location data. Most recent literature presents formal models, namely space-time prism, to track an object's rendezvous patterns within trajectory gaps on a spatial network. However, the bounds derived from the space-time prism are rather loose, resulting in unnecessarily extensive post-processing manual effort. To address these limitations, we propose a Time Slicing-based Gap-Aware Rendezvous Detection (TGARD) algorithm to tighten the spatial bounds in spatial networks. We propose a Dual Convergence TGARD (DC-TGARD) algorithm to improve computational efficiency using a bi-directional pruning approach. Theoretical results show the proposed spatial bounds on the area of possible rendezvous are tighter than that from related work (space-time prism). Experimental results on synthetic and real-world spatial networks (e.g., road networks) show that the proposed DC-TGARD is more scalable than the TGARD algorithm.