Tight bounds for dynamic convex hull queries (again)

DOI10.1145/1247069.1247131MaRDI QIDQ3602893zbMATH OpenOpenAlexFDO

Authors Erik D. Demaine, Mihai Patrascu

Publication date 12 February 2009

Published in Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1247069.1247131

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 1617248
• Dynamic planar convex hull operations in near-logarithmic amortized time
• Three problems about dynamic convex hulls
• A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
• Dynamic geometric data structures via shallow cuttings

Cited in

(6)

• A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
• Dynamic planar convex hull operations in near-logarithmic amortized time
• Simple and robust dynamic two-dimensional convex hull
• scientific article; zbMATH DE number 1617248 (Why is no real title available?)
• Off-Line Maintenance of Planar Configurations
• On Generalized Planar Skyline and Convex Hull Range Queries

This page was built for publication: Tight bounds for dynamic convex hull queries (again)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602893)