An in-place min–max priority search tree

One of the classic data structures for storing point sets in R2 is the priority search tree, introduced by McCreight in 1985. We show that this data structure can be made in-place, i.e., it can be stored in an array such that each entry stores only one point of the point set and no entry is stored i...

Full description

Bibliographic Details

Published in:	Computational geometry : theory and applications Vol. 46; no. 3; pp. 310 - 327
Main Authors:	De, Minati, Maheshwari, Anil, Nandy, Subhas C., Smid, Michiel
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.04.2013
Subjects:	In-place algorithm Maximum empty rectangle Min–max priority search tree Three-sided orthogonal range query In-place algorithm Min–max priority search tree Maximum empty rectangle Three-sided orthogonal range query
ISSN:	0925-7721
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!