Dynamic convex hulls under window-sliding updates
From MaRDI portal
Cites work
- A SIMPLIFIED TECHNIQUE FOR HIDDEN-LINE ELIMINATION IN TERRAINS
- Algorithms for subpath convex hull queries and ray-shooting among segments
- An O(n\log \log n)-Time Algorithm for Triangulating a Simple Polygon
- An efficient algorithm for determining the convex hull of a finite planar set
- An optimal real-time algorithm for planar convex hulls
- Applications of a semi-dynamic convex hull algorithm
- Cartographic line simplification and polygon CSG formulae in O(n^* n) time
- COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS
- Computational geometry. Algorithms and applications.
- Data Structures for Mobile Data
- Decomposable searching problems
- Dynamic planar convex hull operations in near-logarithmic amortized time
- Efficiently Planning Compliant Motion in the Plane
- Enclosing a Set of Objects by Two Minimum Area Rectangles
- Faster kinetic heaps and their use in broadcast scheduling. (Extended abstract)
- scientific article; zbMATH DE number 1617248 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 176570 (Why is no real title available?)
- Maintenance of configurations in the plane
- Off-Line Maintenance of Planar Configurations
- On-line construction of the convex hull of a simple polyline
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- The Ultimate Planar Convex Hull Algorithm?
- Two approaches to building time-windowed geometric data structures
This page was built for publication: Dynamic convex hulls under window-sliding updates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6913063)
