Dynamic Planar Point Location in External Memory

J. Ian Munro, Yakov Nekrich, Michael Wagner
2019 International Symposium on Computational Geometry  
In this paper we describe a fully-dynamic data structure for the planar point location problem in the external memory model. Our data structure supports queries in O(log B n(log log B n) 3 )) I/Os and updates in O(log B n(log log B n) 2 )) amortized I/Os, where n is the number of segments in the subdivision and B is the block size. This is the first dynamic data structure with almost-optimal query cost. For comparison all previously known results for this problem require O(log 2 B n) I/Os to
more » ... wer queries. Our result almost matches the best known upper bound in the internal-memory model.
doi:10.4230/lipics.socg.2019.52 dblp:conf/compgeom/MunroN19 fatcat:ro5wyylxyjgxtcqef5dz5fx4b4