| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 427549 | Information Processing Letters | 2010 | 7 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
