The following pages link to (Q4401020):
Displaying 7 items.
- Using hash tables to manage the time-storage complexity in a point location problem: application to explicit model predictive control (Q716135) (← links)
- On the stabbing number of a random Delaunay triangulation (Q857055) (← links)
- Evaluation of piecewise affine control via binary search tree (Q1400337) (← links)
- I/O-efficient dynamic planar point location (Q1882856) (← links)
- Lower bounds for expected-case planar point location (Q2462734) (← links)
- (Q5116523) (← links)
- I/O-efficient point location using persistent B-trees (Q5463442) (← links)
