arXiv Open Access 2020

Dynamic Products of Ranks

David Eppstein

Lihat Sumber

Abstrak

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(\sqrt{n\log n})$ per update.

Topik & Kata Kunci

cs.CG cs.DS

Penulis (1)

David Eppstein

Format Sitasi

APA MLA BibTeX

Eppstein, D. (2020). Dynamic Products of Ranks. https://arxiv.org/abs/2007.08123

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2020
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓