On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain

From MaRDI portal
Publication:864430

DOI10.1016/J.JCO.2006.05.005zbMATH Open1112.65019OpenAlexW2085382856MaRDI QIDQ864430FDOQ864430


Authors: Fuxiang Yu, Arthur W. Chou, Ker-I Ko Edit this on Wikidata


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




Cites Work


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)