Abstract
Converting a dual graph into a block layout using a computer has been a difficult task. In this paper a new knowledge-based system is presented for the above purpose. The procedure converts the dual of a maximal planar weighted graph developed using graph-theoretic concepts into a block layout using a knowledge-based system. The knowledge base consists of web-grammar rules which select facilities sequentially, determine facility dimensions and achieve automated identification and reduction of empty spaces. The methodology arrives at regular facility shapes while attempting to maximise the preservation of adjacencies specified in the dual graph and minimise the empty spaces. The procedure includes an interactive option to generate alternative solutions and is illustrated using problems containing numerical examples.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
