Dynamic Convex Hulls Under Window-Sliding Updates
نویسندگان
چکیده
We consider the problem of dynamically maintaining convex hull a set S points in plane under following special sequence insertions and deletions (called window-sliding updates): insert point to right all delete leftmost S. propose an O(|S|)-space data structure that can handle each update O(1) amortized time, such standard binary-search-based queries on be answered $$O(\log |S|)$$ itself output time linear its size.
منابع مشابه
Sliding-window dynamic frameproof codes
A sliding-window dynamic frameproof code is a scheme for discouraging the piracy of digital broadcasts through the use of digital fingerprinting. In this paper we formally define sliding-window dynamic frameproof codes and provide optimal constructions for a certain class of these schemes. We also discuss bounds on the number of users such schemes
متن کاملRelative Convex Hulls in Semi-dynamic Subdivisions
We present data structures for maintaining the relative convex hull of a set of points (sites) in the presence of pairwise non-crossing line segments (barriers) that subdivide a bounding box into simply connected faces. Our data structures have O((n + m) log n) size for n sites and m barriers. They support O(m) barrier insertions and O(n) site deletions in O((m + n) polylog (mn)) total time, an...
متن کاملDynamic Geodesic Convex Hulls in Dynamic Simple Polygons
We consider the geodesic convex hulls of points in a simple polygonal region in the presence of non-crossing line segments (barriers) that subdivide the region into simply connected faces. We present an algorithm together with data structures for maintaining the geodesic convex hull of points in each face in a sublinear update time under the fully-dynamic setting where both input points and bar...
متن کاملDynamic TCP Acknowledgment with Sliding Window
The dynamic TCP acknowledgement problem formulated by Dooly et al. has been intensively studied in the area of competitive analysis. However, their framework does not consider the sliding window that restricts the maximum number of packets that the sender can inject into the network without an acknowledgement in TCP protocol. This paper proposes a new problem in which the sliding window is real...
متن کاملDynamic Graphs in the Sliding-Window Model
We present the first algorithms for processing graphs in the slidingwindow model. The sliding window model, introduced by Datar et al. (SICOMP 2002), has become a popular model for processing infinite data streams in small space when older data items (i.e., those that predate a sliding window containing the most recent data items) are considered “stale” and should implicitly be ignored. While p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2023
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-38906-1_46