论文信息 - Computing a Largest Empty Arbitrary Oriented Rectangle: Theory and Implementation

Computing a Largest Empty Arbitrary Oriented Rectangle: Theory and Implementation

In this paper, we report on the theory and implementation of an O(n3) algorithm for computing the largest empty rectangle of arbitrary orientation for a given set of n points in the plane.

Asish Mukhopadhyay | S. V. Rao

[1] D. T. Lee,et al. On the maximum empty rectangle problem , 1984, Discret. Appl. Math..

[2] Bernard Chazelle,et al. Computing the Largest Empty Rectangle , 1986, SIAM J. Comput..

[3] Micha Sharir,et al. Efficient algorithms for geometric optimization , 1998, CSUR.

[4] Alok Aggarwal,et al. Fast algorithms for computing the largest empty rectangle , 1987, SCG '87.

[5] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .

[6] M. Orlowski,et al. A new algorithm for the largest empty rectangle problem , 1990, Algorithmica.