3-rectangulations are spatial representatives of assemblies of boxes into a box. Algorithms to generate various classes of 3-rectangulations are developed. The method is extended to specify the generation of higher-dimensional d-rectangulations, d ≥ 4.
Get full access to this article
View all access options for this article.
References
1.
BlochC JKrishnamurtiR, 1978“The counting of rectangular dissections”Environment and Planning B5207–214
2.
EarlC F, 1978“Joints in two- and three-dimensional rectangular dissections”Environment and Planning B5179–187
3.
EarlC FMarchL J, 1979“Architectural applications of graph theory” in Applications of Graph Theory Eds WilsonR JBeinekeLW, (Academic Press, London) pp 327–355
4.
FlemmingU, 1978“Wall representations of rectangular dissections and their use in automated space allocation”Environment and Planning B5215–232
5.
KrishnamurtiRRoeP H O'N, 1978“Algorithmic aspects of plan generation and enumeration”Environment and Planning B5157–177
6.
KrishnamurtiRRoeP H O'N, 1979“On the generation and enumeration of tessellation designs”Environment and Planning B6191–260
7.
LittlewoodD E, 1931“The groups of the regular solids in n-dimensions”Proceedings of the London Mathematical Society3210–20
8.
MarchL JEarlC F, 1977“On counting architectural plans”Environment and Planning B457–80
9.
TarjanR E, 1972“Depth first search and linear graph algorithms”SIAM Journal on Computing1146–160
