• Login
    View Item 
    •   Eurographics DL Home
    • Computer Graphics Forum
    • Volume 38 (2019)
    • 38-Issue 3
    • View Item
    •   Eurographics DL Home
    • Computer Graphics Forum
    • Volume 38 (2019)
    • 38-Issue 3
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    A Stable Graph Layout Algorithm for Processes

    Thumbnail
    View/Open
    v38i3pp725-737.pdf (1.315Mb)
    1121-file2.pdf (13.22Mb)
    1121-file1.mp4 (17.44Mb)
    Date
    2019
    Author
    Mennens, Robin ORCID
    Scheepens, Roeland ORCID
    Westenberg, Michel ORCID
    Pay-Per-View via TIB Hannover:

    Try if this item/paper is available.

    Metadata
    Show full item record
    Abstract
    Process mining enables organizations to analyze data about their (business) processes. Visualization is key to gaining insight into these processes and the associated data. Process visualization requires a high-quality graph layout that intuitively represents the semantics of the process. Process analysis additionally requires interactive filtering to explore the process data and process graph. The ideal process visualization therefore provides a high-quality, intuitive layout and preserves the mental map of the user during the visual exploration. The current industry standard used for process visualization does not satisfy either of these requirements. In this paper, we propose a novel layout algorithm for processes based on the Sugiyama framework. Our approach consists of novel ranking and order constraint algorithms and a novel crossing minimization algorithm. These algorithms make use of the process data to compute stable, high-quality layouts. In addition, we use phased animation to further improve mental map preservation. Quantitative and qualitative evaluations show that our approach computes layouts of higher quality and preserves the mental map better than the industry standard. Additionally, our approach is substantially faster, especially for graphs with more than 250 edges.
    BibTeX
    @article {10.1111:cgf.13723,
    journal = {Computer Graphics Forum},
    title = {{A Stable Graph Layout Algorithm for Processes}},
    author = {Mennens, Robin and Scheepens, Roeland and Westenberg, Michel},
    year = {2019},
    publisher = {The Eurographics Association and John Wiley & Sons Ltd.},
    ISSN = {1467-8659},
    DOI = {10.1111/cgf.13723}
    }
    URI
    https://doi.org/10.1111/cgf.13723
    https://diglib.eg.org:443/handle/10.1111/cgf13723
    Collections
    • 38-Issue 3

    Eurographics Association copyright © 2013 - 2023 
    Send Feedback | Contact - Imprint | Data Privacy Policy | Disable Google Analytics
    Theme by @mire NV
    System hosted at  Graz University of Technology.
    TUGFhA
     

     

    Browse

    All of Eurographics DLCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    Statistics

    View Usage Statistics

    BibTeX | TOC

    Create BibTeX Create Table of Contents

    Eurographics Association copyright © 2013 - 2023 
    Send Feedback | Contact - Imprint | Data Privacy Policy | Disable Google Analytics
    Theme by @mire NV
    System hosted at  Graz University of Technology.
    TUGFhA