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

DOI10.1016/j.jco.2006.05.005zbMath1112.65019OpenAlexW2085382856MaRDI QIDQ864430

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

zbMATH Keywords

complexitycomputational complexityminimum areacircumscribed rectanglespolynomial-time computable Jordan curve

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Complexity and performance of numerical algorithms (65Y20)

Related Items (2)

In Memoriam: Ker-I Ko (1950–2018) ⋮ Who Asked Us? How the Theory of Computing Answers Questions about Analysis

Uses Software

• GTEngine

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational complexity of real functions
• On the complexity of finding paths in a two-dimensional domain I: Shortest paths
• The computational complexity of some julia sets
• Computing the width of a set
• Determining the minimum-area encasing rectangle for an arbitrary closed curve
• Computational Complexity of Two-Dimensional Regions
• Non-computable Julia sets
• Computing and Combinatorics

This page was built for publication: On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain