Abstract
We investigate the computational complexity of finding the minimum-area circumscribed rectangle of a given two-dimensional domain. We study this problem in the polynomial-time complexity theory of real functions based on the oracle Turing machine model. We show that a bounded domain S with a polynomial-time computable Jordan curve Γ as the boundary may not have a computable minimum-area circumscribed rectangle. We also show that the problem of finding the minimum area of a circumscribed rectangle of a polynomial-time computable Jordan curve Γ is equivalent to a discrete Σ 2 P -complete problem. The related problem of finding the circumscribed squares of a Jordan curve Γ is also studied. We show that for any polynomial-time computable Jordan curve Γ , there must exist at least one computable circumscribed square (not necessarily of the minimum area), but this square may have arbitrarily high complexity.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.