Fully Dynamic Point Location in a Monotone Subdivision
From MaRDI portal
Publication:4732115
DOI10.1137/0218056zbMATH Open0682.68056OpenAlexW2017351109MaRDI QIDQ4732115FDOQ4732115
Authors: Roberto Tamassia, F. P. Preparata 
Publication date: 1989
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0218056
Recommendations
analysis of algorithmscomputational geometrypoint locationdynamic data structuresplanar subdivisionmonotone polygon
Cited In (21)
- Dynamic Trees and Dynamic Point Location
- Dynamic Planar Point Location in External Memory.
- Dynamic reachability in planar digraphs with one source and one sink
- Optimal Point Location in a Monotone Subdivision
- Dynamic Point Location in General Subdivisions
- Quadrangulations of planar sets
- Dynamic maintenance of planar digraphs, with applications
- A data structure for lattice representation
- Title not available (Why is that?)
- Average case analysis of dynamic geometric optimization
- Towards an optimal method for dynamic planar point location
- Visibility with a moving point of view
- An incremental reconstruction method for dynamic planar point location
- Lower bounds for dynamic transitive closure, planar point location, and parentheses matching
- DYNAMIZATION OF THE TRAPEZOID METHOD FOR PLANAR POINT LOCATION IN MONOTONE SUBDIVISIONS
- Characterizing and efficiently computing quadrangulations of planar point sets
- Dynamic point location in arrangements of hyperplanes
- Dynamic planar point location with optimal query time (extended abstract)
- Point Location in Incremental Planar Subdivisions.
- External memory planar point location with logarithmic updates
- A new point-location algorithm and its practical efficiency: comparison with existing algorithms
This page was built for publication: Fully Dynamic Point Location in a Monotone Subdivision
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4732115)
