The following pages link to (Q3138881):
Displaying 6 items.
- Maintaining the minimal distance of a point set in polylogarithmic time (Q1189290) (← links)
- Off-line dynamic maintenance of the width of a planar point set (Q1190292) (← 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)
- On computing the diameter of a point set in high dimensional Euclidean space. (Q1853493) (← links)
- Dynamic half-space range reporting and its applications (Q1891228) (← links)
