Evaluationskriterium: Wie umfangreich können die Graphen sein (Anzahl der Knoten, Kanten), die von dem jeweiligen Visualisierer gehandhabt werden könn

Wie umfangreich können die Graphen sein (Anzahl der Knoten, Kanten), die von dem jeweiligen Visualisierer gehandhabt werden können?

Recherche-Ergebnisse zu interaktive Graph-Visualisierer, H3
Graph-Visualisierung (Papers, Präsentationen), Munzner: Scalability/H3


Dies ist ein Kriterium für die Evaluation.

in Stichpunkten beantwortet: Was sind Schwächen der HTVs? // Welche Schwächen weisen die HTVs auf?

Was sind Schwächen? // Welche Schwächen weisen die HTVs auf?

Recherche-Ergebnisse zu interaktive Graph-Visualisierern, H3, Graph-Visualisierung (Papers, Präsentationen), Navigation, Kriterien für die Informationsvisualisierung

The webviz layout algorithm did not exploit 3D hyperbolic space to its full potential: the amount of displayed information compared to the amount of white space was quite sparse. Moreover, the webviz system drew all links in the graph at all times, so highly connected graphs were quite cluttered.

Munzner irgendwo, Abs. 3, Satz 3-5

in Stichpunkten beantwortet: Was sind die Kernleistungen der HTVs? / Was sind Stärken?

Was sind die Kern-Leistungen der HTVs? / Was sind Stärken?

Recherche-Ergebnisse zu interaktive Graph-Visualisierern, H3, Graph-Visualisierung (Papers, Präsentationen), Navigation, Kriterien für die Informationsvisualisierung, hyperbolischer Baum, hyperbolische Visualisierung, hyperbolischer vs. Euklidischer Raum, Walrus

The fractal tree work of Koike and Yoshimara [KY93] is similar in spirit to hyperbolic approaches. Both tame the exponential explosion of tree nodes by drawing trees in a mathematical space with nonstandard properties - dimension or distance, respectively.

Munzner irgendwo, Abs. 2, Satz 1-2

Our layout is computed using hyperbolic distances instead of the familiar euclidean distance measure. We use the hyperbolic metric in order to take advantage of the surprising property that hyperbolic space has more room than our familiar euclidean space.

Munzner irgendwo, Abs. 1, Satz 1-2

At any moment, the amount of magnification, and thus the level of visible detail, varies across the display. This allows the user to examine the fine details of a small area while always having a view of the whole graph available as a frame of reference.

Walrus, Abschnitt "Description", Abs. 3, Satz 2-3

We optimize the cone tree layout algorithm for 3D hyperbolic space by placing children on a hemisphere around the cone mouth instead of on its perimeter.

T.Munzner, H3__Laying_Out_Large_Directed_Graphs_in_3D_Hyperbolic_Space.htm, Abschnitt "Abstract", Absatz 1, Satz 3 (via)


Pros & Cons

Hyperbolic trees are very valuable to visualize hierarchical structures such as file directories, web sites, classification hierarchies, organization hierarchies, newsgroup structures, etc. While traditional methods such as paging (divide data into several pages and display one page at a time), zooming, or panning show only part of the information at a certain granularity, hyperbolic trees show detail and context at once.

Quelle, Abschnitt "Pros & Cons"

Kriterien für die Evaluation von Thesaurus-Software

"Criteria for the evaluation of thesaurus software / by Jochen Ganzmann. International Classification, 1990, vol.17, no.3/4, p.148-157. Copies of this paper and its checklist of criteria are on this site." (Quelle @ 20040530.04-18, Abschnitt "Thesaurus structure and use", unter der Linkliste "Controlled vocabulary and the Internet"; lokal)


Recherche-Ergebnisse zu Thesaurus allgemein, Thesaurus-(Management-)Softwares