This problem is a clever 2D extension of the Largest Rectangle in Histogram problem. Instead of searching for 2D boundaries blindly, we can transform the matrix into a series of 1D histograms. We ...
Abstract: This paper presents a weighted surplus rectangle algorithm to solve two-dimensional non-guillotine rectangle packing problem. According to four weighting factors, including horizontal axis ...
Finding an inscribed rectangle using VQA (Variational Quantum Algorithm): For any simple closed curve, it is known that four points on the curve can form (at least one) rectangle. In this article, we ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results