A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
An O-tree representation of non-slicing floorplan and its applications

*
Proceedings 1999 Design Automation Conference (Cat. No. 99CH36361)
*

We present an ordered tree, O-tree, structure to represent non-slicing floorplans. The O-tree uses only n (2 + lg n) bits for a floorplan of n rectangular blocks. We define an admissible placement as a compacted placement in both x and y direction. For each admissible placement, we can find an O-tree representation. We show that the number of possible O-tree combinations is O(n! 2 2n -2 / n 1.5 ). This is very concise compared to a sequence pair representation which has O((n!) 2 )

doi:10.1109/dac.1999.781324
fatcat:mvu4hmbgdjd6zpqs7atsopg74e