Three problems about dynamic convex hulls
DOI10.1145/1998196.1998201zbMATH Open1283.68351OpenAlexW2135300727MaRDI QIDQ5404404FDOQ5404404
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
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
convex hullsdynamic data structureshalfspace range searchingorthogonal range searchinglower envelopes
Symbolic computation and algebraic computation (68W30) Data structures (68P05) Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (11)
- Dynamic geodesic convex hulls in dynamic simple polygons
- Dynamic planar convex hull operations in near-logarithmic amortized time
- Dynamic half-space range reporting and its applications
- Relative Convex Hulls in Semi-dynamic Subdivisions
- Title not available (Why is that?)
- Off-Line Maintenance of Planar Configurations
- Relative convex hulls in semi-dynamic arrangements
- A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
- Tight bounds for dynamic convex hull queries (again)
- Title not available (Why is that?)
- 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)
