 Using quadtrees, we provide an alternative algorithm that runs in near linear time , although this second algorithm has a logarithmic dependence on either\big(\big(\big)\big) the ratio of the fastest speed to the slowest speed of disks or the spread of disk centers (the ratio of the maximum to the minimum distance between them).
<meaning-changed>  Using quadtrees, we provide an alternative algorithm that runs in near linear time , although this second algorithm has a logarithmic dependence on either\big(\big(\big)\big) the ratio of the fastest speed to the slowest speed of disks or the spread of disk centers (the ratio of the maximum to the minimum distance between them).
 Using quadtrees, we provide an alternative algorithm that runs in near linear time , although this second algorithm has a logarithmic dependence on either\big(n\big(\big)\big) the ratio of the fastest speed to the slowest speed of disks or the spread of disk centers (the ratio of the maximum to the minimum distance between them).