Pages that link to "Item:Q2223621"
From MaRDI portal
The following pages link to Dynamic geometric data structures via shallow cuttings (Q2223621):
Displaying 7 items.
- Two approaches to building time-windowed geometric data structures (Q2319633) (← links)
- Succinct and Implicit Data Structures for Computational Geometry (Q2848977) (← links)
- (Q3687756) (← links)
- (Q5088951) (← links)
- Towards in-place geometric algorithms and data structures (Q5361676) (← links)
- Dynamic connectivity in disk graphs (Q6145677) (← links)
- How fast can we play Tetris greedily with rectangular pieces? (Q6149495) (← links)
