Two layer 3D floor planning

zbMATH Open1295.05041arXiv1210.4595MaRDI QIDQ396933FDOQ396933

Authors: Gabor Lippner, Paul Horn 

Publication date: 14 August 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: A 3D floor plan is a non-overlapping arrangement of blocks within a large box. Floor planning is a central notion in chip-design, and with recent advances in 3D integrated circuits, understanding 3D floor plans has become important. In this paper, we study so called mosaic 3D floor plans where the interior blocks partition the host box under a topological equivalence. We give representations which give an upper bound on the number of general 3D floor plans, and further consider the number of two layer mosaic floorplans. We prove that the number of two layer mosaic floor plans is $n^{(1+o(1))n/3}$. This contrasts with previous work which has studied `corner free' mosaic floor plans, where the number is just exponential. The upper bound is by giving a representation, while the lower bound is a randomized construction.

Full work available at URL: https://arxiv.org/abs/1210.4595

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Constrained floorplans in 2D and 3D
• Recent developments in floorplan representations
• A bijection between permutations and floorplans, and its applications
• scientific article; zbMATH DE number 1559558
• Three-Dimensional Circuit Layouts

zbMATH Keywords

mosaic3Dfloorplans

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Combinatorial complexity of geometric structures (52C45) Mathematical problems of computer architecture (68M07)

Cites Work

• A bijection between permutations and floorplans, and its applications

Cited In (1)

• Constrained floorplans in 2D and 3D

This page was built for publication: Two layer 3D floor planning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396933)