In software visualization and algorithm animation it is important that advances in system technologies are accompanied by corresponding advances in animation presentations. The authors describe methods for animating three manipulation algorithms, one of the most challenging algorithm animation domains. In particular, they animate operations on pairing heap data structures which are used to implement priority queues. Their animations use tree layout heuristics and smooth transitions for illustrating intermediate algorithm states to promote viewer understanding.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Tidy animations of tree algorithms


    Contributors:
    Stasko, J.T. (author) / Turner, C.R. (author)


    Publication date :

    1992-01-01


    Size :

    302287 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English






    Animations

    Nathan Mahir Schilling | NTRS


    Animations

    N. M. Schilling | NTIS | 2022