Improved Dynamic Planar Point Location

We develop the first linear-space data structures for dynamic planar point location in general subdivisions that achieve logarithmic query time and poly-logarithmic update time

Authors

• Lars Arge
• Gerth Stølting Brodal
• Loukas Georgiadis

Keywords

• Slabs
• Data structures
• Computer science
• Tree data structures
• Electronic mail
• Computational modeling
• Computational geometry
• Graphics
• Spatial databases
• Scholarships
• Local Point
• Dynamic Point
• Data Structure
• Update Time
• Local Plane
• Query Time
• Secondary Structure
• Vertical Line
• Block Size
• Tree Structure
• Structure Of Space
• Machine Model
• Segmentation Of Structures
• Tree Search
• Binary Tree
• Node Level
• Middle Segment
• Set Of Segments
• Path Search
• List Of Nodes
• Tree Segmentation
• Left Endpoint
• Query Structure
• Query Point
• Segment Endpoints
• Balanced Tree
• Range Boundaries
• Static Case
• Node Structure