Dynamic Trees and Dynamic Point Location

DOI10.1137/S0097539793254376zbMATH Open0915.68162MaRDI QIDQ4210167FDOQ4210167

Authors Roberto Tamassia, Michael T. Goodrich 

Publication date 21 September 1998

Published in SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

computational geometrypoint locationon-line algorithmsdynamic data structurescentroid decomposition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Dynamic Point Location in General Subdivisions
• Fully Dynamic Point Location in a Monotone Subdivision
• New Results on Dynamic Planar Point Location

Cites Work

• scientific article; zbMATH DE number 4037201 (Why is no real title available?)
• A New Approach to Planar Point Location
• A balanced search tree O(1) worst-case update time
• A data structure for dynamic trees
• Adding range restriction capability to dynamic data structures
• Dynamic planar point location with optimal query time
• Efficient Point Location in a Convex Spatial Cell-Complex
• Fractional cascading. I: A data structuring technique
• Fractional cascading. II: Applications
• Fully Dynamic Point Location in a Monotone Subdivision
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Location of a Point in a Planar Subdivision and Its Applications
• Maintenance of a minimum spanning forest in a dynamic plane graph
• New Results on Dynamic Planar Point Location
• Optimal Point Location in a Monotone Subdivision
• Optimal Search in Planar Subdivisions
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• Priority Search Trees
• Searching and storing similar lists
• Triangulating a simple polygon
• Triangulating a simple polygon in linear time
• Visibility and intersection problems in plane geometry

Cited In (14)

• Dynamic Planar Point Location in External Memory.
• On the dynamization of data structures
• Dynamic Point Location in General Subdivisions
• Title not available (Why is no real title available?)
• Distance-sensitive planar point location
• New Results on Dynamic Planar Point Location
• Title not available (Why is no real title available?)
• Shape matching under rigid motion
• The maximin line problem with regional demand
• Towards an optimal method for dynamic planar point location
• On the computation of an arrangement of quadrics in 3D
• Dynamic partition trees
• Computing shortest heterochromatic monotone routes
• Point Location in Incremental Planar Subdivisions.

This page was built for publication: Dynamic Trees and Dynamic Point Location

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210167)