On converting a dual graph into a block layout

On converting a dual graph into a block layout

0.00 Avg rating0 Votes
Article ID: iaor1989134
Country: United Kingdom
Volume: 27
Issue: 7
Start Page Number: 1149
End Page Number: 1160
Publication Date: Jul 1989
Journal: International Journal of Production Research
Authors: ,
Keywords: graphs
Abstract:

One of the difficulties associated with the application of graph theory to the facilities layout problem is the conversion of the dual graph into a block layout. This paper presents a procedure to address this problem. The procedure exploits the similarities between the graph-theoretic approach and computerized layout-construction procedures, and also resolves some of their differences. It considers the faces of the dual graph one by one and places them in the block layout adjacent to each other in a manner consistent with the adjacencies specified by the dual graph. The procedure is independent of the manner the maximal planar weighted graph is developed.

Reviews

Required fields are marked *. Your email address will not be published.