We consider the problem of dynamically maintaining the convex hull of a set $S$ of points in the plane under the following special sequence of insertions and deletions (called window-sliding updates): insert a point to the right of all points of $S$ and delete the leftmost point of $S$. We propose an $O(|S|)$-space data structure that can handle each update in $O(1)$ amortized time, such that all standard binary-search-based queries on the convex hull of $S$ can be answered in $O(\log |S|)$ time, and the convex hull itself can be output in time linear in the number of its vertices.

翻译：我们考虑在平面上点集$S$的动态凸包维护问题，具体针对以下特殊的插入与删除序列（称为窗口滑动更新）：在$S$中所有点的右侧插入一个新点，并删除$S$中最左侧的点。我们提出一种空间复杂度为$O(|S|)$的数据结构，能够在均摊$O(1)$时间内处理每次更新，使得所有基于二分查找的标准凸包查询可以在$O(\log |S|)$时间内完成，且凸包本身可以按其顶点数线性时间输出。