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 in a rectangular region, is presented. The worst case time and space complexities of the proposed algorithm are O(n3 ) and O(n2 ) respectively.

• Type: Conference
• Year: 2008
• Where: CCCG
• Authors: Subhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab B. Bhattacharya
• Keywords: Algorithm, CCCG 2008, Computational Geometry, Isothetic Orthoconvex Polygon, Worst Case Time