1 research outputs found
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 in 2D. We first propose an inplace
algorithm for computing the priority search tree with a set of points in
using extra bit space in time. It supports
all the standard queries on priority search tree in time. We also
show an application of this algorithm in computing the largest empty
axis-parallel rectangle. Our proposed algorithm needs time and
work-space apart from the array used for storing input points.
Here is the number of maximal empty rectangles present in .
Finally, we consider the problem of locating the maximum area empty rectangle
of arbitrary orientation among a set of points, and propose an time in-place algorithm for that problem.Comment: 14 pages, 5 figure