Recognition of largest empty orthoconvex polygon in a point set

An algorithm for computing the maximum area empty isothetic orthoconvex polygon among a set of n points on a 2D rectangular region, is presented. The worst-case time and space complexities of the proposed algorithm are O(n3) and O(n2) respectively.