Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Inplace Algorithm for Priority Search Tree and its use in Computing
  Largest Empty Axis-Parallel Rectangle   There is a high demand of space-efficient algorithms in built-in or embedded
softwares. In this paper, we consider the problem of designing space-efficient
algorithms for computing the maximum area empty rectangle (MER) among a set of
points inside a rectangular region $\cal R$ in 2D. We first propose an inplace
algorithm for computing the priority search tree with a set of $n$ points in
$\cal R$ using $O(\log n)$ extra bit space in $O(n\log n)$ time. It supports
all the standard queries on priority search tree in $O(\log^2n)$ time. We also
show an application of this algorithm in computing the largest empty
axis-parallel rectangle. Our proposed algorithm needs $O(n\log^2n +m)$ time and
$O(\log n)$ work-space apart from the array used for storing $n$ input points.
Here $m$ is the number of maximal empty rectangles present in $\cal R$.
Finally, we consider the problem of locating the maximum area empty rectangle
of arbitrary orientation among a set of $n$ points, and propose an $O(n^3\log
n)$ time in-place algorithm for that problem.

16
The categories of this paper are: stat
11
The categories of this paper are: hep-lat
20
The categories of this paper are: acc-phys
32
The categories of this paper are: atom-ph
2
The categories of this paper are: math
13
The categories of this paper are: quant-ph
0
The categories of this paper are: hep-ph
22
The categories of this paper are: chao-dyn
23
The categories of this paper are: solv-int
4
The categories of this paper are: cond-mat
34
The categories of this paper are: chem-ph
26
The categories of this paper are: bayes-an
24
The categories of this paper are: dg-ga
31
The categories of this paper are: ao-sci
35
The categories of this paper are: mtrl-th
33
The categories of this paper are: plasm-ph