Pages that link to "Item:Q1189290"

The following pages link to Maintaining the minimal distance of a point set in polylogarithmic time (Q1189290):

Displaying 7 items.

• Iterated nearest neighbors and finding minimal polytopes (Q1327455) (← links)
• An optimal algorithm for the on-line closest-pair problem (Q1330783) (← links)
• Dynamic Euclidean minimum spanning trees and extrema of binary functions (Q1346130) (← links)
• Dynamic half-space range reporting and its applications (Q1891228) (← links)
• Algorithms for proximity problems in higher dimensions (Q1917037) (← links)
• Efficient construction of a bounded-degree spanner with low weight (Q2365175) (← links)
• Static and dynamic algorithms for k-point clustering problems (Q5060119) (← links)