External memory planar point location with logarithmic updates

DOI10.1145/1377676.1377699MaRDI QIDQ5901412zbMATH OpenOpenAlexFDO

Authors Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao

Publication date 12 February 2009

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

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

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• External memory planar point location with logarithmic updates
• scientific article; zbMATH DE number 742971
• I/O-efficient dynamic planar point location
• scientific article; zbMATH DE number 1305387
• Point location in dynamic planar subdivisions

Cited in

(7)

• Building an optimal point-location structure in \(O(\operatorname{sort}(n))\) I/Os
• I/O-efficient dynamic planar point location
• Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions
• scientific article; zbMATH DE number 1305387 (Why is no real title available?)
• Dynamic Planar Point Location in External Memory.
• Planar point location for large data sets
• External memory planar point location with logarithmic updates

This page was built for publication: External memory planar point location with logarithmic updates

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