Abstract
In this paper, we deal with arbitrary convex and concave rectilinearmodule packing using the Transitive Closure Graph (TCG) representation.The geometric meanings of modules are transparent to TCG and itsinduced operations, which makes TCG an ideal representation for floor-planning/placement with arbitrary rectilinear modules. We first partition arectilinear module into a set of submodules and then derive necessary andsufficient conditions of feasible TCG for the submodules. Unlike mostprevious works that process each submodule individually and thus needpost processing to fix deformed rectilinear modules, our algorithm treatsa set of submodules as a whole and thus not only can guarantee the feasibilityof each perturbed solution but also can eliminate the need of thepost processing on deformed modules, implying better solution qualityand running time. Experimental results show that our TCG-based algorithmis capable of handling very complex instances; further, it is veryefficient and results in better area utilization than previous work.
Published Version
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 call