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.<>


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Tidy animations of tree algorithms


    Beteiligte:
    Stasko, J.T. (Autor:in) / Turner, C.R. (Autor:in)


    Erscheinungsdatum :

    01.01.1992


    Format / Umfang :

    302287 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch





    Animations

    Nathan Mahir Schilling | NTRS


    Animations

    N. M. Schilling | NTIS | 2022