Pages that link to "Item:Q5115796"
From MaRDI portal
The following pages link to On the Complexity of Closest Pair via Polar-Pair of Point-Sets (Q5115796):
Displaying 5 items.
- Maintaining the minimal distance of a point set in polylogarithmic time (Q1189290) (← links)
- A note concerning the closest point pair algorithm. (Q1853012) (← links)
- Two-dimensional closest pair problem: a closer look (Q2004080) (← links)
- On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (Q5090390) (← links)
- A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES (Q5288735) (← links)
