Pages that link to "Item:Q914389"
From MaRDI portal
The following pages link to Dynamic planar point location with optimal query time (Q914389):
Displaying 15 items.
- An incremental reconstruction method for dynamic planar point location (Q750176) (← links)
- Dynamic point location in arrangements of hyperplanes (Q1199133) (← links)
- Monte Carlo approximation of form factors with error bounded a priori (Q1355196) (← links)
- A dynamic fixed windowing problem (Q1825634) (← links)
- I/O-efficient dynamic planar point location (Q1882856) (← links)
- (Q2721994) (← links)
- Optimal dynamic vertical ray shooting in rectilinear planar subdivisions (Q2930252) (← links)
- Efficient Point Location in a Convex Spatial Cell-Complex (Q3990653) (← links)
- Dynamic Trees and Dynamic Point Location (Q4210167) (← links)
- (Q4542709) (← links)
- Adaptive Planar Point Location (Q4580104) (← links)
- Dynamic planar point location with optimal query time (Q5096145) (← links)
- Dynamic planar orthogonal point location in sublogarithmic time (Q5115793) (← links)
- Competitive query strategies for minimising the ply of the potential locations of moving points (Q5174473) (← links)
- Dynamic Distribution-Sensitive Point Location (Q6059978) (← links)