Dynamic Planar Point Location with Sub-Logarithmic Local Updates

Details Dynamic Planar Point Location with Sub-Logarithmic Local Updates Dynamic Planar Point Location with Sub-Logarithmic Local Updates

2012-04-20

arxiv.org/abs/1204.4714v1

Computer Science

Computational Geometry

Scientific paper

We study planar point location in a collection of disjoint fat regions, and investigate the complexity of \emph {local updates}: replacing any region by a different region that is "similar" to the original region. (i.e., the size differs by at most a constant factor, and distance between the two regions is a constant times that size). We show that it is possible to create a linear size data structure that allows for insertions, deletions, and queries in logarithmic time, and allows for local updates in sub-logarithmic time on a pointer machine.

Affiliated with

Also associated with

No associations

Rating

Dynamic Planar Point Location with Sub-Logarithmic Local Updates does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dynamic Planar Point Location with Sub-Logarithmic Local Updates, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic Planar Point Location with Sub-Logarithmic Local Updates will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-6286