Pages that link to "Item:Q2637298"
From MaRDI portal
The following pages link to An optimized divide-and-conquer algorithm for the closest-pair problem in the planar case (Q2637298):
Displaying 5 items.
- Two-dimensional closest pair problem: a closer look (Q2004080) (← links)
- An improved algorithm for finding the closest pair of points (Q2508376) (← links)
- A geometric algorithm based on dynamic rectangular window for closest points (Q3195829) (← links)
- Verification of Closest Pair of Points Algorithms (Q5049012) (← links)
- (Q5482926) (← links)