Dynamic Planar Point Location in External Memory

03/15/2019
by   J. Ian Munro, et al.
0

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

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/07/2019

External Memory Planar Point Location with Fast Updates

We study dynamic planar point location in the External Memory Model or D...
research
09/27/2018

Point Location in Incremental Planar Subdivisions

We study the point location problem in incremental (possibly disconnecte...
research
02/28/2019

Dynamic Planar Convex Hull

In this article, we determine the amortized computational complexity of ...
research
05/19/2018

Orthogonal Point Location and Rectangle Stabbing Queries in 3-d

In this work, we present a collection of new results on two fundamental ...
research
09/20/2021

Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees

We study the problem of designing a resilient data structure maintaining...
research
12/15/2017

Dynamic smooth compressed quadtrees (Fullversion)

We introduce dynamic smooth (a.k.a. balanced) compressed quadtrees with ...
research
07/26/2022

Implementing the Comparison-Based External Sort

In the age of big data, sorting is an indispensable operation for DBMSes...

Please sign up or login with your details

Forgot password? Click here to reset