Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
From MaRDI portal
Publication:2930252
DOI10.1145/1541885.1541889zbMath1298.68113OpenAlexW2116268321MaRDI QIDQ2930252
Haim Kaplan, Yoav Giora, Yoav Giora
Publication date: 18 November 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1541885.1541889
Analysis of algorithms and problem complexity (68Q25) Computer science aspects of computer-aided design (68U07) Computational aspects related to convexity (52B55) Data structures (68P05)
Related Items (13)
Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing ⋮ Dynamic range majority data structures ⋮ Shortest paths among transient obstacles ⋮ On the number of anchored rectangle packings for a planar point set ⋮ Towards an Optimal Method for Dynamic Planar Point Location ⋮ Full-fledged real-time indexing for constant size alphabets ⋮ Relative convex hulls in semi-dynamic arrangements ⋮ Shortest rectilinear path queries to rectangles in a rectangular domain ⋮ Rectilinear link diameter and radius in a rectilinear polygonal domain ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Dynamic Planar Point Location in External Memory. ⋮ A Survey of Data Structures in the Bitprobe Model
This page was built for publication: Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
