On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain
DOI10.1016/J.JCO.2006.05.005zbMATH Open1112.65019OpenAlexW2085382856MaRDI QIDQ864430FDOQ864430
Authors: Fuxiang Yu, Arthur W. Chou, Ker-I Ko
Publication date: 8 February 2007
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2006.05.005
Recommendations
computational complexitycomplexityminimum areacircumscribed rectanglespolynomial-time computable Jordan curve
Complexity and performance of numerical algorithms (65Y20) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Determining the minimum-area encasing rectangle for an arbitrary closed curve
- The computational complexity of some Julia sets
- Title not available (Why is that?)
- Computational complexity of real functions
- Computational Complexity of Two-Dimensional Regions
- Computing the width of a set
- Non-computable Julia sets
- Title not available (Why is that?)
- On the complexity of finding paths in a two-dimensional domain I: Shortest paths
- Computing and Combinatorics
Cited In (3)
Uses Software
This page was built for publication: On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q864430)