Dynamic Products of Ranks

07/16/2020
by   David Eppstein, et al.
0

We describe a data structure that can maintain a dynamic set of points given by their Cartesian coordinates, and maintain the point whose product of ranks within the two coordinate orderings is minimum or maximum, in time O(√(nlog n)) per update.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset