Computing a Largest Empty Arbitrary Oriented Rectangle: Theory and Implementation

摘要

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