Abstract
AbstractThis study considers a set of n rectangles arranged on a plane, and, in particular, the problem of modifying the initial layout within a minimum area while meeting certain conditions, namely, preservation of orthogonal order and prevention of intersection between rectangles. A heuristic algorithm for this problem with O(n2) complexity was proposed by Misue and colleagues. First, the problem of minimum‐area layout adjustment is shown to be NP‐complete. Then, another heuristic algorithm is examined that results in smaller layout area than that of Misue and colleagues. Using computational experiments with random initial layouts, the proposed algorithm is proven to require 15 to 20% of the area required by the Misue algorithm, especially with a large number of rectangles. © 2002 Scripta Technica, Syst Comp Jpn, 33(2): 31–42, 2002
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
