Title

An Incremental Editor For Dynamic Hierarchical Drawing Of Trees

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 monotonie 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. © Springer-Verlag 2004.

Publication Date

1-1-2004

Publication Title

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volume

3038

Number of Pages

986-995

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1007/978-3-540-24688-6_126

Socpus ID

35048836653 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/35048836653

This document is currently not available here.

Share

COinS