Dynamic Products of Ranks
Computational Geometry
2020-07-17 v1 Data Structures and Algorithms
Abstract
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 per update.
Keywords
Cite
@article{arxiv.2007.08123,
title = {Dynamic Products of Ranks},
author = {David Eppstein},
journal= {arXiv preprint arXiv:2007.08123},
year = {2020}
}
Comments
7 pages, 4 figures. To appear at the 32nd Canadian Conference on Computational Geometry (CCCG 2020)