Pages that link to "Item:Q2930252"
From MaRDI portal
The following pages link to Optimal dynamic vertical ray shooting in rectilinear planar subdivisions (Q2930252):
Displaying 15 items.
- Dynamic range majority data structures (Q306716) (← links)
- On the number of anchored rectangle packings for a planar point set (Q344784) (← links)
- Relative convex hulls in semi-dynamic arrangements (Q476434) (← links)
- Shortest paths among transient obstacles (Q2156288) (← links)
- Full-fledged real-time indexing for constant size alphabets (Q2408918) (← links)
- A Survey of Data Structures in the Bitprobe Model (Q2848981) (← links)
- Stabbing horizontal segments with vertical rays (Q2874592) (← links)
- Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing (Q3449825) (← links)
- Towards an Optimal Method for Dynamic Planar Point Location (Q4562277) (← links)
- Dynamic Planar Point Location in External Memory. (Q5088984) (← links)
- Rectilinear link diameter and radius in a rectilinear polygonal domain (Q5091051) (← links)
- Dynamic planar orthogonal point location in sublogarithmic time (Q5115793) (← links)
- (Q5116497) (← links)
- Shortest rectilinear path queries to rectangles in a rectangular domain (Q5896842) (← links)
- Decomposing the complement of the union of cubes and boxes in three dimensions (Q6624162) (← links)