Representation and generation of rectangular dissections

Authors:
Ulrich Flemming
Affiliations:
-
Venue:
DAC '78 Proceedings of the 15th Design Automation Conference
Year:
1978

Citing 2
Cited 5

An approach to computerized space planning using graph theory

DAC '71 Proceedings of the 8th Design Automation Workshop
Formal languages and their relation to automata

Formal languages and their relation to automata

What is a floorplan?

ISPD '00 Proceedings of the 2000 international symposium on Physical design
Placement algorithms for custom VLSI

DAC '83 Proceedings of the 20th Design Automation Conference
Placement algorithms for custom VLSI

Computer-Aided Design
Floor plan design using block algebra and constraint satisfaction

Advanced Engineering Informatics
An evolutionary strategy enhanced with a local search technique for the space allocation problem in architecture, Part 2: Validation and performance tests

Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

The stepwise development of a data structure for representing dissections of rectangles into rectangular components is outlined. The data structure is used to define a finite set of “principal options” for a class of space allocation problems, and a procedure is described which generates dissections representing these options.