Pages that link to "Item:Q4210083"
From MaRDI portal
The following pages link to Randomized Data Structures for the Dynamic Closest-Pair Problem (Q4210083):
Displaying 9 items.
- Deferred data structure for the nearest neighbor problem (Q1183453) (← links)
- Dynamic rectangular point location, with an application to the closest pair problem (Q1346711) (← links)
- An optimal algorithm for closest-pair maintenance (Q1380774) (← links)
- A simple randomized sieve algorithm for the closest-pair problem (Q1891130) (← links)
- A Reliable Randomized Algorithm for the Closest-Pair Problem (Q4366873) (← links)
- Kinetic and dynamic data structures for closest pair and all nearest neighbors (Q4962762) (← links)
- Dynamic closest pairs — A probabilistic approach (Q5056153) (← links)
- Kinetic data structures for all nearest neighbors and closest pair in the plane (Q5174471) (← links)
- Efficient regular data structures and algorithms for dilation, location, and proximity problems (Q5945907) (← links)