zbMATH — the first resource for mathematics

Rectangular dualization and rectangular dissections. (English) Zbl 0663.05027
Rectangular dualization refers to finding a dual of a planar graph, that can be drawn in the form of a rectangular dissection; it has applications in architectural design and in the floorplanning of VLSI IC’s. This paper presents properties of rectangular dissections and discusses two related topics: (1) a problem of enumerating without repetitions all rectangular duals of a graph, and (2) transformations of rectangular dissections.

05C10 Planar graphs; geometric and topological aspects of graph theory
94C15 Applications of graph theory to circuits and networks
Full Text: DOI