Dynamic convex hulls under window-sliding updates
From MaRDI portal
Publication:6139052
DOI10.1007/978-3-031-38906-1_46arXiv2305.08055OpenAlexW4385317171MaRDI QIDQ6139052
No author found.
Publication date: 16 January 2024
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2305.08055
Cites Work
- On-line construction of the convex hull of a simple polyline
- Maintenance of configurations in the plane
- Applications of a semi-dynamic convex hull algorithm
- Decomposable searching problems
- Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- Two approaches to building time-windowed geometric data structures
- An efficient algorithm for determining the convex hull of a finite planar set
- Dynamic planar convex hull operations in near-logarithmic amortized time
- COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS
- Fast Algorithms for Finding Nearest Common Ancestors
- The Ultimate Planar Convex Hull Algorithm?
- Off-Line Maintenance of Planar Configurations
- Enclosing a Set of Objects by Two Minimum Area Rectangles
- An optimal real-time algorithm for planar convex hulls
- Efficiently Planning Compliant Motion in the Plane
- A simplified technique for hidden-line elimination in terrains
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Dynamic convex hulls under window-sliding updates
