Dynamic Planar Point Location in External Memory

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_B^2 n)$ I/Os to answer queries. Our result almost matches the best known upper bound in the internal-memory model.

[1]  Roberto Tamassia,et al.  Dynamization of the trapezoid method for planar point location in monotone subdivisions , 1992, Int. J. Comput. Geom. Appl..

[2]  Kurt Mehlhorn,et al.  Dynamic point location in general subdivisions , 1992, SODA '92.

[3]  Jan Vahrenhold,et al.  I/O-efficient dynamic planar point location , 2004, Comput. Geom..

[4]  Haim Kaplan,et al.  Optimal dynamic vertical ray shooting in rectilinear planar subdivisions , 2007, SODA '07.

[5]  Jeffrey Scott Vitter,et al.  On two-dimensional indexability and optimal range search indexing , 1999, PODS '99.

[6]  Timothy M. Chan,et al.  Towards an Optimal Method for Dynamic Planar Point Location , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[7]  J. Feigenbaum,et al.  Two new kinds of biased search trees , 1983, The Bell System Technical Journal.

[8]  Michael T. Goodrich,et al.  Dynamic trees and dynamic point location , 1991, STOC '91.

[9]  Alon Itai,et al.  A Sparse Table Implementation of Priority Queues , 1981, ICALP.

[10]  Jeffrey Scott Vitter,et al.  External-Memory Algorithms for Processing Line Segments in Geographic Information Systems , 1995, Algorithmica.

[11]  Leonidas J. Guibas,et al.  A new representation for linear lists , 1977, STOC '77.

[12]  Jeffrey Scott Vitter,et al.  External-Memory Computational Geometry (Preliminary Version) , 1993, FOCS 1993.

[13]  S. Srinivasa Rao,et al.  External Memory Planar Point Location with Logarithmic Updates , 2008, Algorithmica.

[14]  Sha-Mayn Teh,et al.  I/O-efficient point location using persistent B-trees , 2003, ALENEX.

[15]  Alok Aggarwal,et al.  The input/output complexity of sorting and related problems , 1988, CACM.

[16]  Leonidas J. Guibas,et al.  Fractional cascading: I. A data structuring technique , 1986, Algorithmica.

[17]  Timothy M. Chan,et al.  Dynamic Planar Orthogonal Point Location in Sublogarithmic Time , 2018, Symposium on Computational Geometry.

[18]  Kurt Mehlhorn,et al.  Dynamic fractional cascading , 1990, Algorithmica.

[19]  Roberto Tamassia,et al.  A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps , 1996, SODA '93.

[20]  Gerth Stølting Brodal.  External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates , 2016, STACS.

[21]  Robert E. Tarjan,et al.  Biased Search Trees , 1985, SIAM J. Comput..

[22]  Roberto Tamassia,et al.  Efficient Point Location in a Convex Spatial Cell-Complex , 1989, SIAM J. Comput..

[23]  Dan E. Willard,et al.  A Density Control Algorithm for Doing Insertions and Deletions in a Sequentially Ordered File in Good Worst-Case Time , 1992, Inf. Comput..

[24]  Roberto Tamassia,et al.  Fully Dynamic Point Location in a Monotone Subdivision , 1989, SIAM J. Comput..

[25]  Jeffrey Scott Vitter,et al.  I/O-efficient dynamic point location in monotone planar subdivisions , 1999, SODA '99.

[26]  Loukas Georgiadis,et al.  Improved Dynamic Planar Point Location , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[27]  Siu-Wing Cheng,et al.  New results on dynamic planar point location , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.