This study introduces time-windowed variations of three established trajectory simplification algorithms. These new algorithms are specifically designed to be used in contexts with bandwidth limitations. We present the details of these algorithms and highlight the differences compared to their classical counterparts. To evaluate their performance, we conduct accuracy assessments for varying sizes of time windows, utilizing two different datasets and exploring different compression ratios. The accuracies of the proposed algorithms are compared with those of existing methods. Our findings demonstrate that, for larger time windows, the enhanced version of the bandwidth-constrained STTrace outperforms other algorithms, with the bandwidth-constrained improved version of \squish also yielding satisfactory results at a lower computational cost. Conversely, for short time windows, only the bandwidth-constrained version of Dead Reckoning remains satisfactory.

中文翻译：

---

带宽限制下简化多轨迹的新算法

本研究介绍了三种已建立的轨迹简化算法的时间窗口变化。这些新算法专门设计用于带宽限制的环境中。我们介绍这些算法的细节，并强调与经典算法相比的差异。为了评估它们的性能，我们利用两个不同的数据集并探索不同的压缩比，对不同大小的时间窗口进行准确性评估。将所提出的算法的精度与现有方法的精度进行了比较。我们的研究结果表明，对于较大的时间窗口，带宽受限的 STTrace 的增强版本优于其他算法，而带宽受限的改进版本 \squish 也以较低的计算成本产生了令人满意的结果。相反，对于短时间窗口，只有带宽受限的航位推算版本仍然令人满意。