Abstract
We propose a fast algorithm to obtain a rectilinear block packing in O((p+1)n) time keeping all the constrains imposed by a given SSP, a conventional method to represent arbitrary rectangle packing. Here, p is the number of rectilinear blocks without simple rectangles, and n is that of rectangle sub-blocks obtained by partitioning each rectilinear block including simple rectangles.
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.
