 When modified for the algebraic decision tree model, insertions and deletions would require O(log2 "n") expected time.It is worth noting, though, that the complexity of the dynamic closest pair algorithm cited above is exponential in the dimension "d", and therefore such an algorithm becomes less suitable for high-dimensional problems.An algorithm for the dynamic closest-pair problem in "d" dimensional space was developed by Sergey Bespamyatnikh in 1998.