An in-place min-max priority search tree

DOI10.1016/j.comgeo.2012.09.007zbMath1257.68058OpenAlexW2044936698MaRDI QIDQ1931277

Minati De, Subhas C. Nandy, Anil Maheshwari, Michiel H. M. Smid

Publication date: 25 January 2013

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2012.09.007

zbMATH Keywords

in-place algorithmmaximum empty rectanglemin-max priority search treethree-sided orthogonal range query

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05)

Related Items (3)

Variations of largest rectangle recognition amidst a bichromatic point set ⋮ Succinct and Implicit Data Structures for Computational Geometry ⋮ Rectilinear path problems in restricted memory setup

This page was built for publication: An in-place min-max priority search tree