Dynamic planar convex hull operations in near-logarithmic amortized time
From MaRDI portal
Publication:2947001
DOI10.1145/363647.363652zbMath1320.68209OpenAlexW2037537665WikidataQ128924592 ScholiaQ128924592MaRDI QIDQ2947001
Publication date: 20 September 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/363647.363652
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (15)
Dynamic coresets ⋮ Dynamic convex hulls under window-sliding updates ⋮ Dynamic connectivity in disk graphs ⋮ On bounded leg shortest paths problems ⋮ Dynamic geometric data structures via shallow cuttings ⋮ Relative convex hulls in semi-dynamic arrangements ⋮ The projection median of a set of points in \({\mathbb{R}}^{d}\) ⋮ Efficient algorithms for maximum regression depth ⋮ Optimal simplification of polygonal chains for subpixel-accurate rendering ⋮ AN EXPERIMENTAL STUDY OF ON-LINE METHODS FOR ZONE CONSTRUCTION IN ARRANGEMENTS OF LINES IN THE PLANE ⋮ Convex hull properties and algorithms ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The projection median of a set of points ⋮ Two approaches to building time-windowed geometric data structures
This page was built for publication: Dynamic planar convex hull operations in near-logarithmic amortized time
