An incremental editor for dynamic hierarchical drawing of trees

    Authors

    D. Workman; M. Bernard;S. Pothoven

    Comments

    Authors: contact us about adding a copy of your work at STARS@ucf.edu

    Keywords

    Computer Science, Hardware & Architecture; Computer Science, Theory &; Methods; Telecommunications

    Abstract

    We present an incremental tree editor based on algorithms for manipulating shape functions. The tree layout is hierarchical, left-to-right. Nodes of variable size and shape are supported. The paper presents algorithms for basic tree editing operations, including cut and paste. The layout algorithm for positioning child-subtrees rooted at a given parent is incrementally recomputed with each edit operation; it attempts to conserve the total display area allocated to child-subtrees while preserving the user's mental map. The runtime and space efficiency is good as a result of exploiting a specially designed Shape abstraction for encoding and manipulating the geometric boundaries of subtrees as monotonic step functions to determine their best placement. All tree operations, including loading, saving trees to files, and incremental cut and paste, are worst case O(N) in time, but typically cut and paste are O(log(N)(2)), where N is the number of nodes.

    Journal Title

    Computational Science - Iccs 2004, Pt 3, Proceedings

    Volume

    3038

    Publication Date

    1-1-2004

    Document Type

    Article

    Language

    English

    First Page

    986

    Last Page

    995

    WOS Identifier

    WOS:000222048900126

    ISSN

    0302-9743; 3-540-22116-6

    Share

    COinS