Competitive learning of network diagram layout

    Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

    12 Citations (Scopus)


    For applications which generate diagrammatic representations, automatic layout techniques are a crucial component. Since graph-like network diagrams are among the most commonly used and most important types of diagrammatic displays, layout techniques for graphs have been extensively studied. However a problem with current graph layout methods which are capable of producing satisfactory results for a wide range of graphs is that they often put an extremely high demand on computational resources. The paper introduces a new layout method that consumes only little computational resources and does not need any heavy duty preprocessing. Unlike other declarative layout algorithms, not even the costly repeated evaluation of an objective function is required. The method presented is based on a competitive learning algorithm which is an extension of self organization strategies known from unsupervised neural networks.

    Original languageEnglish
    Title of host publicationProceedings - 1998 IEEE Symposium on Visual Languages, VL 1998
    PublisherIEEE, Institute of Electrical and Electronics Engineers
    Number of pages8
    ISBN (Electronic)0818687126, 9780818687129
    Publication statusPublished - 1998
    EventIEEE Symposium on Visual Languages 1998 - Halifax, Canada
    Duration: 1 Sept 19984 Sept 1998
    Conference number: 14th (Proceedings)


    ConferenceIEEE Symposium on Visual Languages 1998
    Abbreviated titleVL 1998
    OtherA previous title of "IEEE Symposium on Visual Languages and Human Centric Computing (VL/HCC)"
    Internet address

    Cite this