Three problems about dynamic convex hulls

DOI10.1145/1998196.1998201MaRDI QIDQ5404404zbMATH OpenOpenAlexFDO

Authors Timothy M. Chan

Publication date 24 March 2014

Published in Proceedings of the twenty-seventh annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.418.7542

zbMATH Keywords

convex hullsdynamic data structureshalfspace range searchinglower envelopesorthogonal range searching

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Symbolic computation and algebraic computation (68W30)

Recommendations

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

Cited in

(11)

• Dynamic half-space range reporting and its applications
• scientific article; zbMATH DE number 1617248 (Why is no real title available?)
• Dynamic planar convex hull operations in near-logarithmic amortized time
• Relative Convex Hulls in Semi-dynamic Subdivisions
• A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
• Tight bounds for dynamic convex hull queries (again)
• Off-Line Maintenance of Planar Configurations
• scientific article; zbMATH DE number 108277 (Why is no real title available?)
• Dynamic geodesic convex hulls in dynamic simple polygons
• Relative convex hulls in semi-dynamic arrangements
• Simple and robust dynamic two-dimensional convex hull

This page was built for publication: Three problems about dynamic convex hulls

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