Efficient Visual Navigation
A Study by the Example of Hierarchically Structured Graphs
(Sprache: Englisch)
Visual navigation of hierarchically structured graphs is a technique forinteractively exploring large graphs with an additional hierarchical structuresuch as call graphs of telephone networks. In order to reduce the complexityof the graph, only the...
Leider schon ausverkauft
versandkostenfrei
Buch
59.00 €
Produktdetails
Produktinformationen zu „Efficient Visual Navigation “
Visual navigation of hierarchically structured graphs is a technique forinteractively exploring large graphs with an additional hierarchical structuresuch as call graphs of telephone networks. In order to reduce the complexityof the graph, only the interesting subgraphs are shown in detail, while theothers are collapsed. As the areas of interest change over time, clusters areexpanded or contracted, for which an efficient data structure is needed. Inthis work a new variant of this problem is introduced, which supportsinsertion and deletion of graph nodes. So far efficient data structures wereknown only for more static variants. The proposed data structure builds on anovel technique of superimposing a search tree over an ordered list maintenancestructure. For visualizing the expanding and contracting a localupdate scheme for the well-known algorithm of Sugiyama and Misue ispresented, which has applications ranging from UML diagrams to biochemicalpathways. Experimental results show that this update scheme ismore efficient than redrawing, yet the performance gain is not at the expenseof quality as regards the area of the drawing and the number of crossings.
Klappentext zu „Efficient Visual Navigation “
Visual navigation of hierarchically structured graphs is a technique for interactively exploring large graphs with an additional hierarchical structure such as call graphs of telephone networks. In order to reduce the complexity of the graph, only the interesting subgraphs are shown in detail, while the others are collapsed. As the areas of interest change over time, clusters are expanded or contracted, for which an efficient data structure is needed. In this work a new variant of this problem is introduced, which supports insertion and deletion of graph nodes. So far efficient data structures were known only for more static variants. The proposed data structure builds on a novel technique of superimposing a search tree over an ordered list maintenance structure. For visualizing the expanding and contracting a local update scheme for the well-known algorithm of Sugiyama and Misue is presented, which has applications ranging from UML diagrams to biochemical pathways. Experimental results show that this update scheme is more efficient than redrawing, yet the performance gain is not at the expense of quality as regards the area of the drawing and the number of crossings.
Autoren-Porträt von Marcus Raitner
Dr. rer. nat. Marcus Raitner, Dipl.-Inf. (Univ.)Diploma in Computer Science at the University ofPassau. Research Assistant at the Chair of Prof. Dr.F.-J. Brandenburg (Theoretical Computer Science),University of Passau. Conferral of a doctorate (Dr.rer. nat.) of the University of Passau. ProjectManagement Associate at msg systems ag,Ismaning.
Bibliographische Angaben
- Autor: Marcus Raitner
- 2007, 164 Seiten, Maße: 17 x 24 cm, Kartoniert (TB), Englisch
- Verlag: VDM Verlag Dr. Müller
- ISBN-10: 3836417944
- ISBN-13: 9783836417945
Sprache:
Englisch
Kommentar zu "Efficient Visual Navigation"
0 Gebrauchte Artikel zu „Efficient Visual Navigation“
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "Efficient Visual Navigation".
Kommentar verfassen