InfoVis:Wiki - User contributions [en]

Teaching:TUW - UE InfoVis WS 2009/10 - Gruppe 10 - Aufgabe 4

2010-01-07T17:30:11Z

UE-InfoVis0910 0527037:

== Aufgabenstellung ==
[http://ieg.ifs.tuwien.ac.at/~gschwand/teaching/infovis_ue_ws09/infovis_ue_aufgabe4.html Beschreibung der Aufgabe 4]
=== Zu erstellende Visualisierung ===
-------------------------------
* Stammbaum der Nachkommen von Lisa und Bart Simpson*

...Visualisierung der Nachkommen von Lisa Simpson sowie der Nachkommen von Bart Simpson. Dabei sollen zwei Stammbäume entstehen - einer von Bart und einer von Lisa - die dann miteinander verglichen werden können. Zuerst kommen Lisa und Bart, dann deren Kinder, ihre Enkel, etc. (mind 4 Generationen). Da es noch keine Nachkommen gibt, können diese frei erfunden werden.

Die Visualisierung soll folgende Informationen darstellen:

- Verwandtschaftsverhältnisse (zumindest Eltern-Kinder),

- Unterscheidung zwischen Blutsverwandtschaft und angeheirateten Familienmitgliedern,

- Geburts- und Todestag sowie Lebensdauer von allen Familienmitgliedern,

- wichtige Ereignisse im Leben jedes Familienmitglieds (z.B., Anzeigen, Gefängnisaufenthalte, Schulzeit, Studienzeit, Nobelpreise, Arbeitslosigkeit etc.)

- Zufriedenheit jedes Familienmitglieds (Skala: sehr niedrig - niedrig - mittel - hoch - sehr hoch); kann sich im Laufe des Lebens ändern.

Die Visualisierung soll die interaktive Auseinandersetzung mit den Daten ermöglichen.
Verpflichtend:
Möglichkeiten zum besseren Vergleich von einzelnen Abschnitten der Stammbäume bzw. Vergleich von Ausschnitten aus Lisas und Barts Stammbäumen.
+ mind. 2 weitere Interaktionsmöglichkeiten (z.B., Details on Demand, Filteroptionen)

Allgemein:

- Die Daten sollen zur Analyse von Zusammenhängen zwischen Familienverhältnissen, wichtigen Ereignissen und Zufriedenheit visualisiert werden (die Anwendungsgebiets- und Zielgruppenanalyse kann kurz gehalten werden).

- Die bisher erlernten Design-Prinzipien sollen umgesetzt werden z.B.: Optimierung der Data-ink ratio (keine Comics!), visuelle Attribute (Größe, Farbe, Position, etc.) sollen sinnvoll eingesetzt werden (Information darstellen).

- Die Mockups sollten zumindest 1) die beiden Stammbäume im Überblick und 2) eine detaillierte Vergleichsansicht von 2 Teil-Stammbäumen wiedergeben.

- Alle nicht angeführten Daten können frei erfunden werden.
------------------------------

== Description of application area, data, target group and tasks ==

=== Application area and data ===

A family tree views the genealogy of a person. It is utilized by an individual for seeking information about relatives of various generations. According to the application area of the family tree different details of personal information might be of special interest. For lords the purity of the blood line is the reason to draw a family tree, for youth of today it is rather hobbies and interests of a person.

The given data set contains a group of people with detailed information about their lives. Every person is defined by its name, ancestors, descendants and further personal data such as birth date, education, etc. The data can be classified as follows:
<ul>
<li>Id: discrete</li>
<li>Name: nominal</li>
<li>Dates: ordinal</li>
<li>Gender: binary</li>
<li>Additional information: nominal</li>
</ul>

Visualizing the data properly results in a family tree, which is an ordinate graph showing a hierarchical structure. Each family member is represented by a node in the tree linking with their ancestors and descendants. This characteristic implies that the data set has an explicit hierarchy.

=== Target group ===

Family Trees are usually drawn for people who are interested in their roots. One of the first found fields of application in history was Jesus’ family tree in the changed manner of listing the members of his genealogy. Christians where able to allocate Jesus to well known families. [genWiki] Nowadays this remains not the only purpose. A lot of families split, move and form new families. According to the interests of a target group a visualization method should view different levels of details and kinds of information.

The typical user of the following concept is an adolescent asking herself where she comes from and if her interests might correlate with any of her ancestors‘. Did someone in her family study the same profession or work in a similar field? Was someone also arrested or did somebody win a special award? Since genealogy has been of interest for centuries, there are dozens of kinds of visualizations for family trees existent. Some of their symbols are in common use, other vary according to their field. Lines in shape of ‘u‘ or a ‘=‘ often symbolize a marriage, while circles and triangles represent genders.[Stre87] In the described target group a certain level of detail is of interest, thus another aspect of the data has to be viewable.

=== Aim ===

This visualization is designed not only to seek family members, but to give detailed Information about ancestors. The user should be able to compare different family members as well as sections of the tree. Additionally personal data can be retrieved and also put into comparison. User friendly navigation on the timeline supports the lookup of ancestors. A general overview of the entire family tree gives a general idea of the family structure, while the zoomed in mode allows to receiving a certain level of detail.
Where do I come from? Does my family have a criminal history? Are there certain trends of profession? Who was happy in my family? What did they do in their lives? Where are the location based roots of my family?

== Concept ==

<ul>
<li>Types of Visualization <br\>
Three different Views are visualized. The timeline view is a bar chart that shows the live durance for each person ordered by birth date. As induced by the name the tree view is visualized by a directed graph. Furthermore there is a frame to show the portrait for the chosen person.
</li>
<li>Visual Mapping<br\>
Timeline: <ul>
<li>Age -> Length of a person’s bar (size) in relation to the other bars;</li>
<li>Contentment -> Color of the bar, the happier the person the lighter the green;</li>
<li>Relatives by blood -> Relatives by blood are marked with a bolder stroke</li>
<li>Years -> Years are mapped to intervals on the timeline</li>
</ul>
Tree: <ul>
<li>Gender -> A circle identifies a man, while a triangle identifies a woman</li>
<li>Marriage -> A ‘]’ indicates that two persons are married</li>
<li>Children -> If there is only one Child a simple line is used to link with the parents, in case of two or more children this symbol ‘[‘ is used</li>
<li>Relatives by blood -> Relatives by blood are induced by the stroke weight of the gender symbolization </li>
</ul>
</li>
<li>Interaction<br\>
<ul>
<li>Zooming on the Timeline -> With the little square on the top right corner of the view frame (light green) the user may adjust the timeline to the frame of interest. By zooming in, the level of detail of the visualized years can be augmented (bars get larger). </li>
<li>Selection: Click on a person’s bar (timeline) or symbol (tree view) -> By clicking on a bar the portrait of this person will appear in the Frame next to the Graph. </li>
<li>Double click on bar or symbol -> Per double click the main windows changes its views from timeline to tree view or vice versa. For the clicked person one generation of descendant and according to the zoom factor as much ancestors as the window provides space for. </li>
<li>Filtering -> Entering a word in the search field will filter the family tree. Only thus containing the given criteria will remain in the view. Clicking on the filter symbol more than one criterion can be selected</li>
</ul>
</li>
<li>Mockups<br\>
Timeline view showing comparison with different zoom factors<br\>
[]<br\>
Tree view comparing the family trees of Bart and Lisa <br\>
[[Image:TreeView G10.jpg]]<br\><br\>
</li>
<li>Usability and Characteristics<br\>
Filtering is as simple as entering a word. The system will filter all data by the criterion. Furthermore the tree view will be rendered from the ego perspective chosen and show a four generation of the tree. The zooming panel eases the navigation trough the data, which is especially useful in big data sets. Not everybody might feel familiar with the handling of two different views to choose from. Since the portrait frame is not the biggest a scroll bar will appear once the data exceeds the frame size.
</li>
<li>Enhancement<br\>
Integration of Geneological Data Communication (GEDCOM) file format [Chur99]; A function to invite family member via e-mail;
</li>
</ul>

== Bibliography ==
[genWiki] http://wiki-de.genealogy.net/Stammbaum#_note-2, last viewed Jan 7. 2010 <br\>
[Stre87] Bernhard Streck et al, Wörterbuch der Ethnologie, DuMont, Köln 1987, Page 238<br\>
[Aign09] Aigner Wolfgang, Hierachische Techniken, 30.11.2009 
[Aign09] Aigner Wolfgang, Visual Analytics and Interactions, 10.12.1009<br\>
[Chur99] The Church of Jesus Christ of Latter-day Saints, The Gedcom Standard, Draft Release 55.1, Oct. 2 1999<br\>
------------------------------

== Links ==
* [[Teaching:TUW_-_UE_InfoVis_WS_2009/10|InfoVis:Wiki UE Homepage]]

* [http://ieg.ifs.tuwien.ac.at/~gschwand/teaching/infovis_ue_ws09/ UE InfoVis]

*[[Teaching:TUW - UE InfoVis WS 2009/10 - Gruppe 10|Gruppe 10]]

Teaching:TUW - UE InfoVis WS 2009/10 - Gruppe 10 - Aufgabe 4

2010-01-07T17:29:33Z

UE-InfoVis0910 0527037:

== Aufgabenstellung ==
[http://ieg.ifs.tuwien.ac.at/~gschwand/teaching/infovis_ue_ws09/infovis_ue_aufgabe4.html Beschreibung der Aufgabe 4]
=== Zu erstellende Visualisierung ===
-------------------------------
* Stammbaum der Nachkommen von Lisa und Bart Simpson*

...Visualisierung der Nachkommen von Lisa Simpson sowie der Nachkommen von Bart Simpson. Dabei sollen zwei Stammbäume entstehen - einer von Bart und einer von Lisa - die dann miteinander verglichen werden können. Zuerst kommen Lisa und Bart, dann deren Kinder, ihre Enkel, etc. (mind 4 Generationen). Da es noch keine Nachkommen gibt, können diese frei erfunden werden.

Die Visualisierung soll folgende Informationen darstellen:

- Verwandtschaftsverhältnisse (zumindest Eltern-Kinder),

- Unterscheidung zwischen Blutsverwandtschaft und angeheirateten Familienmitgliedern,

- Geburts- und Todestag sowie Lebensdauer von allen Familienmitgliedern,

- wichtige Ereignisse im Leben jedes Familienmitglieds (z.B., Anzeigen, Gefängnisaufenthalte, Schulzeit, Studienzeit, Nobelpreise, Arbeitslosigkeit etc.)

- Zufriedenheit jedes Familienmitglieds (Skala: sehr niedrig - niedrig - mittel - hoch - sehr hoch); kann sich im Laufe des Lebens ändern.

Die Visualisierung soll die interaktive Auseinandersetzung mit den Daten ermöglichen.
Verpflichtend:
Möglichkeiten zum besseren Vergleich von einzelnen Abschnitten der Stammbäume bzw. Vergleich von Ausschnitten aus Lisas und Barts Stammbäumen.
+ mind. 2 weitere Interaktionsmöglichkeiten (z.B., Details on Demand, Filteroptionen)

Allgemein:

- Die Daten sollen zur Analyse von Zusammenhängen zwischen Familienverhältnissen, wichtigen Ereignissen und Zufriedenheit visualisiert werden (die Anwendungsgebiets- und Zielgruppenanalyse kann kurz gehalten werden).

- Die bisher erlernten Design-Prinzipien sollen umgesetzt werden z.B.: Optimierung der Data-ink ratio (keine Comics!), visuelle Attribute (Größe, Farbe, Position, etc.) sollen sinnvoll eingesetzt werden (Information darstellen).

- Die Mockups sollten zumindest 1) die beiden Stammbäume im Überblick und 2) eine detaillierte Vergleichsansicht von 2 Teil-Stammbäumen wiedergeben.

- Alle nicht angeführten Daten können frei erfunden werden.
------------------------------

== Description of application area, data, target group and tasks ==

=== Application area and data ===

A family tree views the genealogy of a person. It is utilized by an individual for seeking information about relatives of various generations. According to the application area of the family tree different details of personal information might be of special interest. For lords the purity of the blood line is the reason to draw a family tree, for youth of today it is rather hobbies and interests of a person.

The given data set contains a group of people with detailed information about their lives. Every person is defined by its name, ancestors, descendants and further personal data such as birth date, education, etc. The data can be classified as follows:
<ul>
<li>Id: discrete</li>
<li>Name: nominal</li>
<li>Dates: ordinal</li>
<li>Gender: binary</li>
<li>Additional information: nominal</li>
</ul>

Visualizing the data properly results in a family tree, which is an ordinate graph showing a hierarchical structure. Each family member is represented by a node in the tree linking with their ancestors and descendants. This characteristic implies that the data set has an explicit hierarchy.

=== Target group ===

Family Trees are usually drawn for people who are interested in their roots. One of the first found fields of application in history was Jesus’ family tree in the changed manner of listing the members of his genealogy. Christians where able to allocate Jesus to well known families. [genWiki] Nowadays this remains not the only purpose. A lot of families split, move and form new families. According to the interests of a target group a visualization method should view different levels of details and kinds of information.

The typical user of the following concept is an adolescent asking herself where she comes from and if her interests might correlate with any of her ancestors‘. Did someone in her family study the same profession or work in a similar field? Was someone also arrested or did somebody win a special award? Since genealogy has been of interest for centuries, there are dozens of kinds of visualizations for family trees existent. Some of their symbols are in common use, other vary according to their field. Lines in shape of ‘u‘ or a ‘=‘ often symbolize a marriage, while circles and triangles represent genders.[Stre87] In the described target group a certain level of detail is of interest, thus another aspect of the data has to be viewable.

=== Aim ===

This visualization is designed not only to seek family members, but to give detailed Information about ancestors. The user should be able to compare different family members as well as sections of the tree. Additionally personal data can be retrieved and also put into comparison. User friendly navigation on the timeline supports the lookup of ancestors. A general overview of the entire family tree gives a general idea of the family structure, while the zoomed in mode allows to receiving a certain level of detail.
Where do I come from? Does my family have a criminal history? Are there certain trends of profession? Who was happy in my family? What did they do in their lives? Where are the location based roots of my family?

== Concept ==

<ul>
<li>Types of Visualization <br\>
Three different Views are visualized. The timeline view is a bar chart that shows the live durance for each person ordered by birth date. As induced by the name the tree view is visualized by a directed graph. Furthermore there is a frame to show the portrait for the chosen person.
</li>
<li>Visual Mapping<br\>
Timeline: <ul>
<li>Age -> Length of a person’s bar (size) in relation to the other bars;</li>
<li>Contentment -> Color of the bar, the happier the person the lighter the green;</li>
<li>Relatives by blood -> Relatives by blood are marked with a bolder stroke</li>
<li>Years -> Years are mapped to intervals on the timeline</li>
</ul>
Tree: <ul>
<li>Gender -> A circle identifies a man, while a triangle identifies a woman</li>
<li>Marriage -> A ‘]’ indicates that two persons are married</li>
<li>Children -> If there is only one Child a simple line is used to link with the parents, in case of two or more children this symbol ‘[‘ is used</li>
<li>Relatives by blood -> Relatives by blood are induced by the stroke weight of the gender symbolization </li>
</ul>
</li>
<li>Interaction<br\>
<ul>
<li>Zooming on the Timeline -> With the little square on the top right corner of the view frame (light green) the user may adjust the timeline to the frame of interest. By zooming in, the level of detail of the visualized years can be augmented (bars get larger). </li>
<li>Selection: Click on a person’s bar (timeline) or symbol (tree view) -> By clicking on a bar the portrait of this person will appear in the Frame next to the Graph. </li>
<li>Double click on bar or symbol -> Per double click the main windows changes its views from timeline to tree view or vice versa. For the clicked person one generation of descendant and according to the zoom factor as much ancestors as the window provides space for. </li>
<li>Filtering -> Entering a word in the search field will filter the family tree. Only thus containing the given criteria will remain in the view. Clicking on the filter symbol more than one criterion can be selected</li>
</ul>
</li>
<li>Mockups<br\>
Timeline view showing comparison with different zoom factors<br\>
[]<br\>
Tree view comparing the family trees of Bart and Lisa <br\>
[[Image:TreeView G10.jpg]]
</li>
<li>Usability and Characteristics<br\>
Filtering is as simple as entering a word. The system will filter all data by the criterion. Furthermore the tree view will be rendered from the ego perspective chosen and show a four generation of the tree. The zooming panel eases the navigation trough the data, which is especially useful in big data sets. Not everybody might feel familiar with the handling of two different views to choose from. Since the portrait frame is not the biggest a scroll bar will appear once the data exceeds the frame size.
</li>
<li>Enhancement<br\>
Integration of Geneological Data Communication (GEDCOM) file format [Chur99]; A function to invite family member via e-mail;
</li>
</ul>

== Bibliography ==
[genWiki] http://wiki-de.genealogy.net/Stammbaum#_note-2, last viewed Jan 7. 2010 <br\>
[Stre87] Bernhard Streck et al, Wörterbuch der Ethnologie, DuMont, Köln 1987, Page 238<br\>
[Aign09] Aigner Wolfgang, Hierachische Techniken, 30.11.2009 
[Aign09] Aigner Wolfgang, Visual Analytics and Interactions, 10.12.1009<br\>
[Chur99] The Church of Jesus Christ of Latter-day Saints, The Gedcom Standard, Draft Release 55.1, Oct. 2 1999<br\>
------------------------------

== Links ==
* [[Teaching:TUW_-_UE_InfoVis_WS_2009/10|InfoVis:Wiki UE Homepage]]

* [http://ieg.ifs.tuwien.ac.at/~gschwand/teaching/infovis_ue_ws09/ UE InfoVis]

*[[Teaching:TUW - UE InfoVis WS 2009/10 - Gruppe 10|Gruppe 10]]

File:TreeView G10.jpg

2010-01-07T17:27:48Z

UE-InfoVis0910 0527037: Visualization of the TreeView

== Summary ==
Visualization of the TreeView
== Copyright status ==

== Source ==

Teaching talk:TUW - UE InfoVis WS 2009/10 - Gruppe 10 - Aufgabe 3

2009-11-30T18:17:18Z

UE-InfoVis0910 0527037: New page: Detailled information exists only from 2007 so it cannot be grouped according to the purpose of spent money. The details of 2007 are not included in the graphic but appear as a kind of leg...

Detailled information exists only from 2007 so it cannot be grouped according to the purpose of spent money. The details of 2007 are not included in the graphic but appear as a kind of legend.
 
The graphic only stresses the rising trend but no exact values within the years
We can only read two amounts of money and the year numbers. Furthermore the lie factor of this graphic cannot be evaluated. 
We assumed the data density to be okay if you stick with this type of visualization, since a reduction of the area size would make it not readable anymore. If visualized in another way the density could be maximized.
 
The big red cross in the centre is unnecessary non data ink and therefore visual clutter.
 
This type of visualization is not well chosen for the given type of data.
 
Because the circle size grows with the amount of spent money and not the sequence of years, its not acceptable to hide the Information of the year (in the inner red circle $375B), because it cannot be understood from reading the graphic.

Teaching talk:TUW - UE InfoVis WS 2009/10 - Gruppe 10 - Aufgabe 2

2009-11-18T12:16:50Z

UE-InfoVis0910 0527037:

==Critic==
Style critic 
<ol>
<li>The lines in the table are to heavy and seperate the data too much. Furthermore the visual flow is disturbed by them.</li>
<li>Numbers are not aligned properly</li>
<li>The www column doesn't stand out from the other columns</li>
</ol>
Data critic: 
<ol>
<li>The title is missing and so it's difficult to guess the table's subject.</li>
<li>Normalize data units, to make it comprehensible for people, who are not familiar with the conversion of units</li>
<li>Header Titles are too long and not understandable</li>
<li>The order of the row headers don't support the comprehension of the information</li>
</ol>

==Corrections==

<ol>
<li>The title is missing and so it's difficult to guess the table's subject.</li>
<li>Normalize data units, to make it comprehensible for people, who are not familiar with the conversion of units</li>
<li>Header Titles are too long and not understandable</li>
<li>The order of the row headers don't support the comprehension of the information</li>
</ol>

Teaching:TUW - UE InfoVis WS 2009/10 - Gruppe 10 - Aufgabe 2

2009-11-18T12:08:23Z

UE-InfoVis0910 0527037:

== Aufgabenstellung ==
[http://ieg.ifs.tuwien.ac.at/~gschwand/teaching/infovis_ue_ws09/infovis_ue_aufgabe2.html Beschreibung der Aufgabe 2]
=== Zu beurteilende Tabelle ===
[[Image:table3_2.gif]]

=== Verbesserte Tabelle ===
[[Image:Table3_2_corrected.jpg]]

== Links ==

* [[Teaching:TUW_-_UE_InfoVis_WS_2009/10|InfoVis:Wiki UE Homepage]]

* [http://ieg.ifs.tuwien.ac.at/~gschwand/teaching/infovis_ue_ws09/ UE InfoVis]

*[[Teaching:TUW - UE InfoVis WS 2009/10 - Gruppe 10|Gruppe 10]]

Teaching:TUW - UE InfoVis WS 2009/10 - Gruppe 10 - Aufgabe 2

2009-11-18T12:07:04Z

UE-InfoVis0910 0527037:

== Aufgabenstellung ==
[http://ieg.ifs.tuwien.ac.at/~gschwand/teaching/infovis_ue_ws09/infovis_ue_aufgabe2.html Beschreibung der Aufgabe 2]
=== Zu beurteilende Tabelle ===
[[Image:table3_2.gif]]

== Links ==

* [[Teaching:TUW_-_UE_InfoVis_WS_2009/10|InfoVis:Wiki UE Homepage]]

* [http://ieg.ifs.tuwien.ac.at/~gschwand/teaching/infovis_ue_ws09/ UE InfoVis]

*[[Teaching:TUW - UE InfoVis WS 2009/10 - Gruppe 10|Gruppe 10]]

Teaching:TUW - UE InfoVis WS 2009/10 - Gruppe 10 - Aufgabe 2

2009-11-18T12:04:57Z

UE-InfoVis0910 0527037:

== Aufgabenstellung ==
[http://ieg.ifs.tuwien.ac.at/~gschwand/teaching/infovis_ue_ws09/infovis_ue_aufgabe2.html Beschreibung der Aufgabe 2]
=== Corrected Table ===
[[Image:Table_3_2.gif]]

== Links ==

* [[Teaching:TUW_-_UE_InfoVis_WS_2009/10|InfoVis:Wiki UE Homepage]]

* [http://ieg.ifs.tuwien.ac.at/~gschwand/teaching/infovis_ue_ws09/ UE InfoVis]

*[[Teaching:TUW - UE InfoVis WS 2009/10 - Gruppe 10|Gruppe 10]]

Teaching:TUW - UE InfoVis WS 2009/10 - Gruppe 10 - Aufgabe 2

2009-11-18T11:58:22Z

UE-InfoVis0910 0527037:

== Aufgabenstellung ==
[http://ieg.ifs.tuwien.ac.at/~gschwand/teaching/infovis_ue_ws09/infovis_ue_aufgabe2.html Beschreibung der Aufgabe 2]
=== Corrected Table ===
[[Image:Table_3_2_corrected.jpg]]

== Links ==

* [[Teaching:TUW_-_UE_InfoVis_WS_2009/10|InfoVis:Wiki UE Homepage]]

* [http://ieg.ifs.tuwien.ac.at/~gschwand/teaching/infovis_ue_ws09/ UE InfoVis]

*[[Teaching:TUW - UE InfoVis WS 2009/10 - Gruppe 10|Gruppe 10]]

Teaching:TUW - UE InfoVis WS 2009/10 - Gruppe 10 - Aufgabe 2

2009-11-18T11:56:59Z

UE-InfoVis0910 0527037:

== Aufgabenstellung ==
[http://ieg.ifs.tuwien.ac.at/~gschwand/teaching/infovis_ue_ws09/infovis_ue_aufgabe2.html Beschreibung der Aufgabe 2]
=== Corrected Table ===
[[Image:table_3_2_corrected.jpg]]

== Links ==

* [[Teaching:TUW_-_UE_InfoVis_WS_2009/10|InfoVis:Wiki UE Homepage]]

* [http://ieg.ifs.tuwien.ac.at/~gschwand/teaching/infovis_ue_ws09/ UE InfoVis]

*[[Teaching:TUW - UE InfoVis WS 2009/10 - Gruppe 10|Gruppe 10]]

Teaching:TUW - UE InfoVis WS 2009/10 - Gruppe 10 - Aufgabe 2

2009-11-18T11:56:14Z

UE-InfoVis0910 0527037:

== Aufgabenstellung ==
[http://ieg.ifs.tuwien.ac.at/~gschwand/teaching/infovis_ue_ws09/infovis_ue_aufgabe2.html Beschreibung der Aufgabe 2]
=== Corrected Table ===
[[Image:Table_3_2_corrected.jpg]]

== Links ==

* [[Teaching:TUW_-_UE_InfoVis_WS_2009/10|InfoVis:Wiki UE Homepage]]

* [http://ieg.ifs.tuwien.ac.at/~gschwand/teaching/infovis_ue_ws09/ UE InfoVis]

*[[Teaching:TUW - UE InfoVis WS 2009/10 - Gruppe 10|Gruppe 10]]

File:Table3 2 corrected.jpg

2009-11-18T11:51:43Z

UE-InfoVis0910 0527037: Observed spreading of spyware within the University of Washington's network

== Summary ==
Observed spreading of spyware within the University of Washington's network
== Copyright status ==

== Source ==

Teaching:TUW - UE InfoVis WS 2009/10 - Gruppe 10 - Aufgabe 2

2009-11-18T11:40:31Z

UE-InfoVis0910 0527037:

== Aufgabenstellung ==
[http://ieg.ifs.tuwien.ac.at/~gschwand/teaching/infovis_ue_ws09/infovis_ue_aufgabe2.html Beschreibung der Aufgabe 2]
=== Zu beurteilende Tabelle ===
[[Image:table.gif]]

== Links ==

* [[Teaching:TUW_-_UE_InfoVis_WS_2009/10|InfoVis:Wiki UE Homepage]]

* [http://ieg.ifs.tuwien.ac.at/~gschwand/teaching/infovis_ue_ws09/ UE InfoVis]

*[[Teaching:TUW - UE InfoVis WS 2009/10 - Gruppe 10|Gruppe 10]]

File:Table.jpg

2009-11-18T11:38:19Z

UE-InfoVis0910 0527037: Observed spreading of spyware within the University of Washington's network

== Summary ==
Observed spreading of spyware within the University of Washington's network
== Copyright status ==

== Source ==

Teaching:TUW - UE InfoVis WS 2008/09 - Gruppe 03 - Aufgabe 1 - Cone Tree

2009-11-03T11:53:07Z

UE-InfoVis0910 0527037:

== Introduction ==
{{Quotation| ... the Cone Tree, which is used for visualizing hierarchical information structures.|[Robertson et al., 1991]}}
[[Image:Big tree.jpg|thumb|none|right|150px|2D Tree diagram with 365 leaves, 729 nodes [VanWijk, 2008]]]

Cone Trees are a suitable visualization technique for dealing with a great amount of information in hierachichal structure, with the aim to display and navigate through the information in an intuitative manner. On screens a 2D layout of such structures wouldn't be easy to handle with. It would not fit on the screen and "The user would have to either scroll through the layout or use a size-reduced image of the structure."[Robertson et al., 1991]

{{Quotation| The hierarchy is presented in 3D to maximize effective use of available screen space and enable visualization of the whole structure.|[Robertson et al., 1991]}}

Instead of a 2D tree Cone Trees use three dimensional space. Therefore a parent node and its children are placed in that kind, so parent and children form a cone, with the parent at the apex and the children along the circular base of the cone.

== Definition ==
Cone Trees represent hierachical data in a three dimensional way and allow fast navigation through these. Big amounts of data can be seen at once, thus the entire structure of a hierarchy is shown all at once. To view demanded data from this visualization method the cones spin around.

== The idea in detail ==

[[Image:robertson_plate2.jpg|thumb|none|right|150px|Cone tree after a selection rotation is completed. [Robertson et al., 1991]]]

A Cone Tree is a three dimensional diagram with visible graphical edge from parents to their children (node-link diagram).

The root node is placed at the apex of the cone tree. All children nodes are placed at equal distances along the base. This process is repeated for every following level. Hence a child node may span further cones. The aspect ratio of the tree is fixed to fit the room, whereas each layer of cones has the same height.

A key idea is the possibility of interaction. For navigation the user can rotate the cone and choose a special node.

{{Quotation| When a node is selected with the mouse, the Cone Tree rotates so that the selected node and each node in the path from the selected node up to the top are brought to the front and highlighted.|[Robertson et al., 1991]}}

These rotations are shown the user with animations.

[[Image:robertson_plate3.jpg|thumb|none|right|150px|An alternative, horizontally oriented layout, called the ''Cam Tree''. [Robertson et al., 1991]]]

{{Quotation| Interactive animation is used to shift some of the user's cognitive load to the human perceptual system. ... animation allows the perceptual system to track the rotations.|[Robertson et al., 1991]}}

There is the possibility of an alternative horizontally layout, called the Cam Tree, which displays text for each node, compensating the problem of the other view, where text is only shown for the selected path.

== Critics ==
A study showed that subjects were signiﬁcantly slower at locating named ﬁles in a hierarchical data structure when using a cone tree interface than when using a 'normal' tree interface. [Cockburn and Mckenzie, 2000]
And Cone Trees "seem to inherit a problem of standard node-link diagrams: they fall short when it comes to large trees. [Ying-Huey Fua] Visual clutters appear when showing more than 1000 nodes. [[Teaching:TUW_-_UE_InfoVis_WS_2008/09_-_Gruppe_06_-_Aufgabe_1_-_Treemap|Treemaps]] [Shneiderman, 1992] were invented by shneiderman to address this particular problem."[VanWijk et al., 2003]

== References ==
* [1] [Robertson et al., 1991] George Robertson, Jock D. Mackinlay, Stuart Card. Cone Trees: Animated 3D Visualizations of Hierarchical Information. In Proceedings of the ACM CHI 91 Human Factors in Computing Systems Conference, pages 189-- 194, April 28 - June 5, 1991, New Orleans, Louisiana, June 1991. Association for Computing Machinery
* [2] [VanWijk, 2008] Jack van Wijk. Information Visualization Visual Analytics. ''I-science for Astronomy, October 13-17, 2008''. Lorentz center, Leiden. Retrieved at: November 7, 2008. http://www.lorentzcenter.nl/lc/web/2008/321/presentations/VanWijk.pdf
* [3] [Cockburn and Mckenzie, 2000] Andy Cockburn, Bruce Mckenzie. An Evaluation of Cone Trees. In ''People and Computers XIV: British Computer Society Conference on Human Computer Interaction 2000'', p425--436. Springer-Verlag.
* [4] [Ying-Huey Fua] Visualizing Hierarchies Via Exotic Trees, Worchester Polytechnic Institute, November 3, 2009. http://davis.wpi.edu/~matt/courses/trees/

* [5] [Shneiderman, 1992] Ben Shneiderman. Tree visualization with tree-maps: A 2-D space-filling approach. ACM Transactions on Graphics 11, pages 92--99, 1992. Association for Computing Machinery
* [6] [VanWijk et al., 2003] Jarke J. van Wijk, Frank Van Ham, Huub Van De Wetering. Rendering Hierarchical Data. Communications of the ACM, pages 257--263, 2003. Association for Computing Machinery

Teaching:TUW - UE InfoVis WS 2008/09 - Gruppe 03 - Aufgabe 1 - Cone Tree

2009-11-03T11:52:38Z

UE-InfoVis0910 0527037:

== Introduction ==
{{Quotation| ... the Cone Tree, which is used for visualizing hierarchical information structures.|[Robertson et al., 1991]}}
[[Image:Big tree.jpg|thumb|none|right|150px|2D Tree diagram with 365 leaves, 729 nodes [VanWijk, 2008]]]

Cone Trees are a suitable visualization technique for dealing with a great amount of information in hierachichal structure, with the aim to display and navigate through the information in an intuitative manner. On screens a 2D layout of such structures wouldn't be easy to handle with. It would not fit on the screen and "The user would have to either scroll through the layout or use a size-reduced image of the structure."[Robertson et al., 1991]

{{Quotation| The hierarchy is presented in 3D to maximize effective use of available screen space and enable visualization of the whole structure.|[Robertson et al., 1991]}}

Instead of a 2D tree Cone Trees use three dimensional space. Therefore a parent node and its children are placed in that kind, so parent and children form a cone, with the parent at the apex and the children along the circular base of the cone.

== Definition ==
Cone Trees represent hierachical data in a three dimensional way and allow fast navigation through these. Big amounts of data can be seen at once, thus the entire structure of a hierarchy is shown all at once. To view demanded data from this visualization method the cones spin around.

== The idea in detail ==

[[Image:robertson_plate2.jpg|thumb|none|right|150px|Cone tree after a selection rotation is completed. [Robertson et al., 1991]]]

A Cone Tree is a three dimensional diagram with visible graphical edge from parents to their children (node-link diagram).

The root node is placed at the apex of the cone tree. All children nodes are placed at equal distances along the base. This process is repeated for every following level. Hence a child node may span further cones. The aspect ratio of the tree is fixed to fit the room, whereas each layer of cones has the same height.

A key idea is the possibility of interaction. For navigation the user can rotate the cone and choose a special node.

{{Quotation| When a node is selected with the mouse, the Cone Tree rotates so that the selected node and each node in the path from the selected node up to the top are brought to the front and highlighted.|[Robertson et al., 1991]}}

These rotations are shown the user with animations.

[[Image:robertson_plate3.jpg|thumb|none|right|150px|An alternative, horizontally oriented layout, called the ''Cam Tree''. [Robertson et al., 1991]]]

{{Quotation| Interactive animation is used to shift some of the user's cognitive load to the human perceptual system. ... animation allows the perceptual system to track the rotations.|[Robertson et al., 1991]}}

There is the possibility of an alternative horizontally layout, called the Cam Tree, which displays text for each node, compensating the problem of the other view, where text is only shown for the selected path.

== Critics ==
A study showed that subjects were signiﬁcantly slower at locating named ﬁles in a hierarchical data structure when using a cone tree interface than when using a 'normal' tree interface. [Cockburn and Mckenzie, 2000]
And Cone Trees "seem to inherit a problem of standard node-link diagrams: they fall short when it comes to large trees. [Ying-Huey Fua] Visual clutters appear when showing more than 1000 nodes. [[Teaching:TUW_-_UE_InfoVis_WS_2008/09_-_Gruppe_06_-_Aufgabe_1_-_Treemap|Treemaps]] [Shneiderman, 1992] were invented by shneiderman to address this particular problem."[VanWijk et al., 2003]

== References ==
* [1] [Robertson et al., 1991] George Robertson, Jock D. Mackinlay, Stuart Card. Cone Trees: Animated 3D Visualizations of Hierarchical Information. In Proceedings of the ACM CHI 91 Human Factors in Computing Systems Conference, pages 189-- 194, April 28 - June 5, 1991, New Orleans, Louisiana, June 1991. Association for Computing Machinery
* [2] [VanWijk, 2008] Jack van Wijk. Information Visualization Visual Analytics. ''I-science for Astronomy, October 13-17, 2008''. Lorentz center, Leiden. Retrieved at: November 7, 2008. http://www.lorentzcenter.nl/lc/web/2008/321/presentations/VanWijk.pdf
* [3] [Cockburn and Mckenzie, 2000] Andy Cockburn, Bruce Mckenzie. An Evaluation of Cone Trees. In ''People and Computers XIV: British Computer Society Conference on Human Computer Interaction 2000'', p425--436. Springer-Verlag.
* [4] [Ying-Huey Fua] Visualizing Hierarchies Via Exotic Trees, Worchester Polytechnic Institute, November 3, 2009

* [5] [Shneiderman, 1992] Ben Shneiderman. Tree visualization with tree-maps: A 2-D space-filling approach. ACM Transactions on Graphics 11, pages 92--99, 1992. Association for Computing Machinery
* [6] [VanWijk et al., 2003] Jarke J. van Wijk, Frank Van Ham, Huub Van De Wetering. Rendering Hierarchical Data. Communications of the ACM, pages 257--263, 2003. Association for Computing Machinery

Teaching:TUW - UE InfoVis WS 2008/09 - Gruppe 03 - Aufgabe 1 - Cone Tree

2009-11-03T11:47:17Z

UE-InfoVis0910 0527037:

== Introduction ==
{{Quotation| ... the Cone Tree, which is used for visualizing hierarchical information structures.|[Robertson et al., 1991]}}
[[Image:Big tree.jpg|thumb|none|right|150px|2D Tree diagram with 365 leaves, 729 nodes [VanWijk, 2008]]]

Cone Trees are a suitable visualization technique for dealing with a great amount of information in hierachichal structure, with the aim to display and navigate through the information in an intuitative manner. On screens a 2D layout of such structures wouldn't be easy to handle with. It would not fit on the screen and "The user would have to either scroll through the layout or use a size-reduced image of the structure."[Robertson et al., 1991]

{{Quotation| The hierarchy is presented in 3D to maximize effective use of available screen space and enable visualization of the whole structure.|[Robertson et al., 1991]}}

Instead of a 2D tree Cone Trees use three dimensional space. Therefore a parent node and its children are placed in that kind, so parent and children form a cone, with the parent at the apex and the children along the circular base of the cone.

== Definition ==
Cone Trees represent hierachical data in a three dimensional way and allow fast navigation through these. Big amounts of data can be seen at once, thus the entire structure of a hierarchy is shown all at once. To view demanded data from this visualization method the cones spin around.

== The idea in detail ==

[[Image:robertson_plate2.jpg|thumb|none|right|150px|Cone tree after a selection rotation is completed. [Robertson et al., 1991]]]

A Cone Tree is a three dimensional diagram with visible graphical edge from parents to their children (node-link diagram).

The root node is placed at the apex of the cone tree. All children nodes are placed at equal distances along the base. This process is repeated for every following level. Hence a child node may span further cones. The aspect ratio of the tree is fixed to fit the room, whereas each layer of cones has the same height.

A key idea is the possibility of interaction. For navigation the user can rotate the cone and choose a special node.

{{Quotation| When a node is selected with the mouse, the Cone Tree rotates so that the selected node and each node in the path from the selected node up to the top are brought to the front and highlighted.|[Robertson et al., 1991]}}

These rotations are shown the user with animations.

[[Image:robertson_plate3.jpg|thumb|none|right|150px|An alternative, horizontally oriented layout, called the ''Cam Tree''. [Robertson et al., 1991]]]

{{Quotation| Interactive animation is used to shift some of the user's cognitive load to the human perceptual system. ... animation allows the perceptual system to track the rotations.|[Robertson et al., 1991]}}

There is the possibility of an alternative horizontally layout, called the Cam Tree, which displays text for each node, compensating the problem of the other view, where text is only shown for the selected path.

== Critics ==
A study showed that subjects were signiﬁcantly slower at locating named ﬁles in a hierarchical data structure when using a cone tree interface than when using a 'normal' tree interface. [Cockburn and Mckenzie, 2000]
And Cone Trees "seem to inherit a problem of standard node-link diagrams: they fall short when it comes to large trees. [Ying-Huey Fua] Visual clutters appear when showing more than 1000 nodes. [[Teaching:TUW_-_UE_InfoVis_WS_2008/09_-_Gruppe_06_-_Aufgabe_1_-_Treemap|Treemaps]] [Shneiderman, 1992] were invented by shneiderman to address this particular problem."[VanWijk et al., 2003]

== References ==
* [1] [Robertson et al., 1991] George Robertson, Jock D. Mackinlay, Stuart Card. Cone Trees: Animated 3D Visualizations of Hierarchical Information. In Proceedings of the ACM CHI 91 Human Factors in Computing Systems Conference, pages 189-- 194, April 28 - June 5, 1991, New Orleans, Louisiana, June 1991. Association for Computing Machinery
* [2] [VanWijk, 2008] Jack van Wijk. Information Visualization Visual Analytics. ''I-science for Astronomy, October 13-17, 2008''. Lorentz center, Leiden. Retrieved at: November 7, 2008. http://www.lorentzcenter.nl/lc/web/2008/321/presentations/VanWijk.pdf
* [3] [Cockburn and Mckenzie, 2000] Andy Cockburn, Bruce Mckenzie. An Evaluation of Cone Trees. In ''People and Computers XIV: British Computer Society Conference on Human Computer Interaction 2000'', p425--436. Springer-Verlag.
* [4] [Shneiderman, 1992] Ben Shneiderman. Tree visualization with tree-maps: A 2-D space-filling approach. ACM Transactions on Graphics 11, pages 92--99, 1992. Association for Computing Machinery
* [5] [VanWijk et al., 2003] Jarke J. van Wijk, Frank Van Ham, Huub Van De Wetering. Rendering Hierarchical Data. Communications of the ACM, pages 257--263, 2003. Association for Computing Machinery

Teaching:TUW - UE InfoVis WS 2008/09 - Gruppe 03 - Aufgabe 1 - Cone Tree

2009-11-03T11:44:09Z

UE-InfoVis0910 0527037:

== Introduction ==
{{Quotation| ... the Cone Tree, which is used for visualizing hierarchical information structures.|[Robertson et al., 1991]}}
[[Image:Big tree.jpg|thumb|none|right|150px|2D Tree diagram with 365 leaves, 729 nodes [VanWijk, 2008]]]

Cone Trees are a suitable visualization technique for dealing with a great amount of information in hierachichal structure, with the aim to display and navigate through the information in an intuitative manner. On screens a 2D layout of such structures wouldn't be easy to handle with. It would not fit on the screen and "The user would have to either scroll through the layout or use a size-reduced image of the structure."[Robertson et al., 1991]

{{Quotation| The hierarchy is presented in 3D to maximize effective use of available screen space and enable visualization of the whole structure.|[Robertson et al., 1991]}}

Instead of a 2D tree Cone Trees use three dimensional space. Therefore a parent node and its children are placed in that kind, so parent and children form a cone, with the parent at the apex and the children along the circular base of the cone.

== Definition ==
Cone Trees represent hierachical data in a three dimensional way and allow fast navigation through these. Big amounts of data can be seen at once, thus the entire structure of a hierarchy is shown all at once. To view demanded data from this visualization method the cones spin around.

== The idea in detail ==

[[Image:robertson_plate2.jpg|thumb|none|right|150px|Cone tree after a selection rotation is completed. [Robertson et al., 1991]]]

A Cone Tree is a three dimensional diagram with visible graphical edge from parents to their children (node-link diagram).

The root node is placed at the apex of the cone tree. All children nodes are placed at equal distances along the base. This process is repeated for every following level. Hence a child node may span further cones. The aspect ratio of the tree is fixed to fit the room, whereas each layer of cones has the same height.

A key idea is the possibility of interaction. For navigation the user can rotate the cone and choose a special node.

{{Quotation| When a node is selected with the mouse, the Cone Tree rotates so that the selected node and each node in the path from the selected node up to the top are brought to the front and highlighted.|[Robertson et al., 1991]}}

These rotations are shown the user with animations.

[[Image:robertson_plate3.jpg|thumb|none|right|150px|An alternative, horizontally oriented layout, called the ''Cam Tree''. [Robertson et al., 1991]]]

{{Quotation| Interactive animation is used to shift some of the user's cognitive load to the human perceptual system. ... animation allows the perceptual system to track the rotations.|[Robertson et al., 1991]}}

There is the possibility of an alternative horizontally layout, called the Cam Tree, which displays text for each node, compensating the problem of the other view, where text is only shown for the selected path.

== Critics ==
A study showed that subjects were signiﬁcantly slower at locating named ﬁles in a hierarchical data structure when using a cone tree interface than when using a 'normal' tree interface. [Cockburn and Mckenzie, 2000]
And Cone Trees "seem to inherit a problem of standard node-link diagrams: they fall short when it comes to large trees. Visual clutters appear when showing more than 1000 nodes. [[Teaching:TUW_-_UE_InfoVis_WS_2008/09_-_Gruppe_06_-_Aufgabe_1_-_Treemap|Treemaps]] [Shneiderman, 1992] were invented by shneiderman to address this particular problem."[VanWijk et al., 2003]

== References ==
* [1] [Robertson et al., 1991] George Robertson, Jock D. Mackinlay, Stuart Card. Cone Trees: Animated 3D Visualizations of Hierarchical Information. In Proceedings of the ACM CHI 91 Human Factors in Computing Systems Conference, pages 189-- 194, April 28 - June 5, 1991, New Orleans, Louisiana, June 1991. Association for Computing Machinery
* [2] [VanWijk, 2008] Jack van Wijk. Information Visualization Visual Analytics. ''I-science for Astronomy, October 13-17, 2008''. Lorentz center, Leiden. Retrieved at: November 7, 2008. http://www.lorentzcenter.nl/lc/web/2008/321/presentations/VanWijk.pdf
* [3] [Cockburn and Mckenzie, 2000] Andy Cockburn, Bruce Mckenzie. An Evaluation of Cone Trees. In ''People and Computers XIV: British Computer Society Conference on Human Computer Interaction 2000'', p425--436. Springer-Verlag.
* [4] [Shneiderman, 1992] Ben Shneiderman. Tree visualization with tree-maps: A 2-D space-filling approach. ACM Transactions on Graphics 11, pages 92--99, 1992. Association for Computing Machinery
* [5] [VanWijk et al., 2003] Jarke J. van Wijk, Frank Van Ham, Huub Van De Wetering. Rendering Hierarchical Data. Communications of the ACM, pages 257--263, 2003. Association for Computing Machinery

Teaching:TUW - UE InfoVis WS 2008/09 - Gruppe 03 - Aufgabe 1 - Cone Tree

2009-11-03T11:30:30Z

UE-InfoVis0910 0527037:

== Introduction ==
{{Quotation| ... the Cone Tree, which is used for visualizing hierarchical information structures.|[Robertson et al., 1991]}}
[[Image:Big tree.jpg|thumb|none|right|150px|2D Tree diagram with 365 leaves, 729 nodes [VanWijk, 2008]]]

Cone Trees are a suitable visualization technique for dealing with a great amount of information in hierachichal structure, with the aim to display and navigate through the information in an intuitative manner. On screens a 2D layout of such structures wouldn't be easy to handle with. It would not fit on the screen and "The user would have to either scroll through the layout or use a size-reduced image of the structure."[Robertson et al., 1991]

{{Quotation| The hierarchy is presented in 3D to maximize effective use of available screen space and enable visualization of the whole structure.|[Robertson et al., 1991]}}

Instead of a 2D tree Cone Trees use three dimensional space. Therefore a parent node and its children are placed in that kind, so parent and children form a cone, with the parent at the apex and the children along the circular base of the cone.

== Definition ==
Cone Trees represent hierachical data in a three dimensional way and allow fast navigation through these. Big amounts of data can be seen at once, thus the entire structure of a hierarchy is shown all at once. To view demanded data from this visualization method the cones spin around.

== The idea in detail ==

[[Image:robertson_plate2.jpg|thumb|none|right|150px|Cone tree after a selection rotation is completed. [Robertson et al., 1991]]]

A Cone Tree is a three dimensional diagram with visible graphical edge from parents to their children (node-link diagram).

The root node is placed at the apex of the cone tree. All children nodes are placed at equal distances along the base. This process is repeated for every following level. Hence a child node may span further cones. The aspect ratio of the tree is fixed to fit the room, whereas each layer of cones has the same height.

A key idea is the possibility of interaction. For navigation the user can rotate the cone and choose a special node.

{{Quotation| When a node is selected with the mouse, the Cone Tree rotates so that the selected node and each node in the path from the selected node up to the top are brought to the front and highlighted.|[Robertson et al., 1991]}}

These rotations are shown the user with animations.

[[Image:robertson_plate3.jpg|thumb|none|right|150px|An alternative, horizontally oriented layout, called the ''Cam Tree''. [Robertson et al., 1991]]]

{{Quotation| Interactive animation is used to shift some of the user's cognitive load to the human perceptual system. ... animation allows the perceptual system to track the rotations.|[Robertson et al., 1991]}}

There is the possibility of an alternative horizontally layout, called the Cam Tree, which displays text for each node, compensating the problem of the other view, where text is only shown for the selected path.

== Critics ==
A study showed that subjects were signiﬁcantly slower at locating named ﬁles in a hierarchical data structure when using a cone tree interface than when using a 'normal' tree interface. [Cockburn and Mckenzie, 2000]
And Cone Trees "seem to inherit a problem of standard node-link diagrams: they fall short when it comes to large trees. [[Teaching:TUW_-_UE_InfoVis_WS_2008/09_-_Gruppe_06_-_Aufgabe_1_-_Treemap|Treemaps]] [Shneiderman, 1992] were invented by shneiderman to address this particular problem."[VanWijk et al., 2003]

== References ==
* [Robertson et al., 1991] George Robertson, Jock D. Mackinlay, Stuart Card. Cone Trees: Animated 3D Visualizations of Hierarchical Information. In Proceedings of the ACM CHI 91 Human Factors in Computing Systems Conference, pages 189-- 194, April 28 - June 5, 1991, New Orleans, Louisiana, June 1991. Association for Computing Machinery
* [VanWijk, 2008] Jack van Wijk. Information Visualization Visual Analytics. ''I-science for Astronomy, October 13-17, 2008''. Lorentz center, Leiden. Retrieved at: November 7, 2008. http://www.lorentzcenter.nl/lc/web/2008/321/presentations/VanWijk.pdf
* [Cockburn and Mckenzie, 2000] Andy Cockburn, Bruce Mckenzie. An Evaluation of Cone Trees. In ''People and Computers XIV: British Computer Society Conference on Human Computer Interaction 2000'', p425--436. Springer-Verlag.
* [Shneiderman, 1992] Ben Shneiderman. Tree visualization with tree-maps: A 2-D space-filling approach. ACM Transactions on Graphics 11, pages 92--99, 1992. Association for Computing Machinery
* [VanWijk et al., 2003] Jarke J. van Wijk, Frank Van Ham, Huub Van De Wetering. Rendering Hierarchical Data. Communications of the ACM, pages 257--263, 2003. Association for Computing Machinery

Teaching:TUW - UE InfoVis WS 2008/09 - Gruppe 03 - Aufgabe 1 - Cone Tree

2009-11-03T11:29:03Z

UE-InfoVis0910 0527037:

== Introduction ==
{{Quotation| ... the Cone Tree, which is used for visualizing hierarchical information structures.|[Robertson et al., 1991]}}
[[Image:Big tree.jpg|thumb|none|right|150px|2D Tree diagram with 365 leaves, 729 nodes [VanWijk, 2008]]]

Cone Trees are a suitable visualization technique for dealing with a great amount of information in hierachichal structure, with the aim to display and navigate through the information in an intuitative manner. On screens a 2D layout of such structures wouldn't be easy to handle with. It would not fit on the screen and "The user would have to either scroll through the layout or use a size-reduced image of the structure."[Robertson et al., 1991]

{{Quotation| The hierarchy is presented in 3D to maximize effective use of available screen space and enable visualization of the whole structure.|[Robertson et al., 1991]}}

Instead of a 2D tree Cone Trees use three dimensional space. Therefore a parent node and its children are placed in that kind, so parent and children form a cone, with the parent at the apex and the children along the circular base of the cone.

== Definition ==
Cone Trees represent hierachical data in a three dimensional way and allow fast navigation through these. Big amounts of data can be seen at once, thus the entire structure of a hierarchy is shown all at once. To view demanded data from this visualization method the cones spin around.

== The idea in detail ==

[[Image:robertson_plate2.jpg|thumb|none|right|150px|Cone tree after a selection rotation is completed. [Robertson et al., 1991]]]

A Cone Tree is a three dimensional diagram with visible graphical edge from parents to their children (node-link diagram).

The root node is placed at the apex of the cone tree. All children nodes are placed at equal distances along the base. This process is repeated for every following level. Hence a child node may span further cones. The aspect ratio of the tree is fixed to fit the room, whereas each layer of cones has the same height.

A key idea is the possibility of interaction. For navigation the user can rotate the cone and choose a special node.

{{Quotation| When a node is selected with the mouse, the Cone Tree rotates so that the selected node and each node in the path from the selected node up to the top are brought to the front and highlighted.|[Robertson et al., 1991]}}

These rotations are shown the user with animations.

[[Image:robertson_plate3.jpg|thumb|none|right|150px|An alternative, horizontally oriented layout, called the ''Cam Tree''. [Robertson et al., 1991]]]

{{Quotation| Interactive animation is used to shift some of the user's cognitive load to the human perceptual system. ... animation allows the perceptual system to track the rotations.|[Robertson et al., 1991]}}

There is the possibility of an alternative horizontally layout, called the Cam Tree, which displays text for each node, compensating the problem of the other view, where text is only shown for the selected path.

== Critics ==
A study showed that subjects were signiﬁcantly slower at locating named ﬁles in a hierarchical data structure when using a cone tree interface than when using a 'normal' tree interface. [Cockburn and Mckenzie, 2000]
And Cone Trees "seem to inherit a problem of standard node-link diagrams: they fall short when it comes to large trees. [[Teaching:TUW_-_UE_InfoVis_WS_2008/09_-_Gruppe_06_-_Aufgabe_1_-_Treemap|Treemaps]] [Shneiderman, 1992] were invented by shneiderman to address this particular problem."[VanWijk et al., 2003]

== References ==
* [Robertson et al., 1991] George Robertson, Jock D. Mackinlay, Stuart Card. Cone Trees: Animated 3D Visualizations of Hierarchical Information. In Proceedings of the ACM CHI 91 Human Factors in Computing Systems Conference, pages 189-- 194, April 28 - June 5, 1991, New Orleans, Louisiana, June 1991. Association for Computing Machinery
* [VanWijk, 2008] Jack van Wijk. Information Visualization Visual Analytics. ''I-science for Astronomy, October 13-17, 2008''. Lorentz center, Leiden. Retrieved at: November 7, 2008. http://www.lorentzcenter.nl/lc/web/2008/321/presentations/VanWijk.pdf
* [Cockburn and Mckenzie, 2000] Andy Cockburn, Bruce Mckenzie. An Evaluation of Cone Trees. In ''People and Computers XIV: British Computer Society Conference on Human Computer Interaction 2000'', p425--436. Springer-Verlag.
* [Shneiderman, 1992] Ben Shneiderman. Tree visualization with tree-maps: A 2-D space-filling approach. ACM Transactions on Graphics 11, pages 92--99, 1992. Association for Computing Machinery
* [VanWijk et al., 2003] Jarke J. van Wijk, Frank Van Ham, Huub Van De Wetering. Rendering Hierarchical Data. Communications of the ACM, pages 257--263, 2003. Association for Computing Machinery

Teaching:TUW - UE InfoVis WS 2008/09 - Gruppe 03 - Aufgabe 1 - Cone Tree

2009-11-03T11:19:03Z

UE-InfoVis0910 0527037:

== Introduction ==
{{Quotation| ... the Cone Tree, which is used for visualizing hierarchical information structures.|[Robertson et al., 1991]}}
[[Image:Big tree.jpg|thumb|none|right|150px|2D Tree diagram with 365 leaves, 729 nodes [VanWijk, 2008]]]

Cone Trees are a suitable visualization technique for dealing with a great amount of information in hierachichal structure, with the aim to display and navigate through the information in an intuitative manner. On screens a 2D layout of such structures wouldn't be easy to handle with. It would not fit on the screen and "The user would have to either scroll through the layout or use a size-reduced image of the structure."[Robertson et al., 1991]

{{Quotation| The hierarchy is presented in 3D to maximize effective use of available screen space and enable visualization of the whole structure.|[Robertson et al., 1991]}}

Instead of a 2D tree Cone Trees use three dimensional space. Therefore a parent node and its children are placed in that kind, so parent and children form a cone, with the parent at the apex and the children along the circular base of the cone.

== Definition ==
Data represented in form of a Cone Tree provides faster navigation and allows more information to be seen at one time in comparison to normal trees. The Cone Tree shows the structure of an entire hierarchy all at once, and the cones spin around to retrieve occluded data. (Image courtesy of Palo Alto Research Center; Brian Tramontana, photographer.)

== The idea in detail ==

[[Image:robertson_plate2.jpg|thumb|none|right|150px|Cone tree after a selection rotation is completed. [Robertson et al., 1991]]]

A Cone Tree is a three dimensional diagram with visible graphical edge from parents to their children (node-link diagram).

The root node is placed at the apex of the cone tree. All children nodes are placed at equal distances along the base. This process is repeated for every following level. Hence a child node may span further cones. The aspect ratio of the tree is fixed to fit the room, whereas each layer of cones has the same height.

A key idea is the possibility of interaction. For navigation the user can rotate the cone and choose a special node.

{{Quotation| When a node is selected with the mouse, the Cone Tree rotates so that the selected node and each node in the path from the selected node up to the top are brought to the front and highlighted.|[Robertson et al., 1991]}}

These rotations are shown the user with animations.

[[Image:robertson_plate3.jpg|thumb|none|right|150px|An alternative, horizontally oriented layout, called the ''Cam Tree''. [Robertson et al., 1991]]]

{{Quotation| Interactive animation is used to shift some of the user's cognitive load to the human perceptual system. ... animation allows the perceptual system to track the rotations.|[Robertson et al., 1991]}}

There is the possibility of an alternative horizontally layout, called the Cam Tree, which displays text for each node, compensating the problem of the other view, where text is only shown for the selected path.

== Critics ==
A study showed that subjects were signiﬁcantly slower at locating named ﬁles in a hierarchical data structure when using a cone tree interface than when using a 'normal' tree interface. [Cockburn and Mckenzie, 2000]
And Cone Trees "seem to inherit a problem of standard node-link diagrams: they fall short when it comes to large trees. [[Teaching:TUW_-_UE_InfoVis_WS_2008/09_-_Gruppe_06_-_Aufgabe_1_-_Treemap|Treemaps]] [Shneiderman, 1992] were invented by shneiderman to address this particular problem."[VanWijk et al., 2003]

== References ==
* [Robertson et al., 1991] George Robertson, Jock D. Mackinlay, Stuart Card. Cone Trees: Animated 3D Visualizations of Hierarchical Information. In Proceedings of the ACM CHI 91 Human Factors in Computing Systems Conference, pages 189-- 194, April 28 - June 5, 1991, New Orleans, Louisiana, June 1991. Association for Computing Machinery
* [VanWijk, 2008] Jack van Wijk. Information Visualization Visual Analytics. ''I-science for Astronomy, October 13-17, 2008''. Lorentz center, Leiden. Retrieved at: November 7, 2008. http://www.lorentzcenter.nl/lc/web/2008/321/presentations/VanWijk.pdf
* [Cockburn and Mckenzie, 2000] Andy Cockburn, Bruce Mckenzie. An Evaluation of Cone Trees. In ''People and Computers XIV: British Computer Society Conference on Human Computer Interaction 2000'', p425--436. Springer-Verlag.
* [Shneiderman, 1992] Ben Shneiderman. Tree visualization with tree-maps: A 2-D space-filling approach. ACM Transactions on Graphics 11, pages 92--99, 1992. Association for Computing Machinery
* [VanWijk et al., 2003] Jarke J. van Wijk, Frank Van Ham, Huub Van De Wetering. Rendering Hierarchical Data. Communications of the ACM, pages 257--263, 2003. Association for Computing Machinery

User:UE-InfoVis0910 0527037

2009-10-28T08:47:21Z

UE-InfoVis0910 0527037:

Kickinger, Nina 
[[Teaching:TUW - UE InfoVis WS 2009/10 - Gruppe 10|Gruppe 10 (Kickinger, Ramser, Wittmann)]]
 
[[{{ns:6}}:Nina.jpg]]

User:UE-InfoVis0910 0527037

2009-10-28T08:47:06Z

UE-InfoVis0910 0527037:

<bold>Kickinger, Nina</bold> 
[[Teaching:TUW - UE InfoVis WS 2009/10 - Gruppe 10|Gruppe 10 (Kickinger, Ramser, Wittmann)]]
 
[[{{ns:6}}:Nina.jpg]]

User:UE-InfoVis0910 0527037

2009-10-28T08:45:56Z

UE-InfoVis0910 0527037:

Kickinger, Nina 
[[Teaching:TUW - UE InfoVis WS 2009/10 - Gruppe 10|Gruppe 10 (Kickinger, Ramser, Wittmann)]]
 
[[{{ns:6}}:Nina.jpg]]

Teaching:TUW - UE InfoVis WS 2009/10 - Gruppe 10

2009-10-28T08:44:43Z

UE-InfoVis0910 0527037: New page: == Gruppenmitglieder == Nina, Kickinger Ruth, Wittmann == Aufgaben == [[Teaching:TUW - UE InfoVis WS 2009/10 - G...

== Gruppenmitglieder ==

[[User:UE-InfoVis0910_0527037|Nina, Kickinger]] 
[[User:UE-InfoVis0910_0504433|Ruth, Wittmann]] 
== Aufgaben ==

[[Teaching:TUW - UE InfoVis WS 2009/10 - Gruppe 10 - Aufgabe 0|Aufgabe 0]] 
[[Teaching:TUW - UE InfoVis WS 2009/10 - Gruppe 10 - Aufgabe 1|Aufgabe 1]] 
[[Teaching:TUW - UE InfoVis WS 2009/10 - Gruppe 10 - Aufgabe 2|Aufgabe 2]] 
[[Teaching:TUW - UE InfoVis WS 2009/10 - Gruppe 10 - Aufgabe 3|Aufgabe 3]] 
[[Teaching:TUW - UE InfoVis WS 2009/10 - Gruppe 10 - Aufgabe 4|Aufgabe 4]]

User:UE-InfoVis0910 0527037

2009-10-28T08:43:11Z

UE-InfoVis0910 0527037:

Kickinger, Nina [[{{ns:6}}:Nina.jpg]]
[[Teaching:TUW - UE InfoVis WS 2009/10 - Gruppe 10|Gruppe 10 (Kickinger, Ramser, Wittmann)]]

Teaching:TUW - UE InfoVs WS 2009/10 - Gruppe 10

2009-10-28T08:38:50Z

UE-InfoVis0910 0527037: Teaching:TUW - UE InfoVs WS 2009/10 - Gruppe 10 moved to Teaching:TUW - UE InfoVs WS 2009/10 - Gruppe 10 Gruppe 10 (Kickinger, Ramser, Wittmann)

#REDIRECT [[Teaching:TUW - UE InfoVs WS 2009/10 - Gruppe 10 Gruppe 10 (Kickinger, Ramser, Wittmann)]]

Teaching:TUW - UE InfoVs WS 2009/10 - Gruppe 10 Gruppe 10 (Kickinger, Ramser, Wittmann)

2009-10-28T08:38:50Z

UE-InfoVis0910 0527037: Teaching:TUW - UE InfoVs WS 2009/10 - Gruppe 10 moved to Teaching:TUW - UE InfoVs WS 2009/10 - Gruppe 10 Gruppe 10 (Kickinger, Ramser, Wittmann)

Gruppe 10 (Kickinger, Ramser, Wittmann)

2009-10-28T08:35:02Z

UE-InfoVis0910 0527037: Gruppe 10 (Kickinger, Ramser, Wittmann) moved to Teaching:TUW - UE InfoVs WS 2009/10 - Gruppe 10

#REDIRECT [[Teaching:TUW - UE InfoVs WS 2009/10 - Gruppe 10]]

Teaching:TUW - UE InfoVs WS 2009/10 - Gruppe 10 Gruppe 10 (Kickinger, Ramser, Wittmann)

2009-10-28T08:35:02Z

UE-InfoVis0910 0527037: Gruppe 10 (Kickinger, Ramser, Wittmann) moved to Teaching:TUW - UE InfoVs WS 2009/10 - Gruppe 10

Teaching:TUW - UE InfoVs WS 2009/10 - Gruppe 10 Gruppe 10 (Kickinger, Ramser, Wittmann)

2009-10-28T08:32:24Z

UE-InfoVis0910 0527037:

User:UE-InfoVis0910 0527037

2009-10-28T08:29:32Z

UE-InfoVis0910 0527037:

Kickinger, Nina [[{{ns:6}}:Nina.jpg]]

User:UE-InfoVis0910 0527037

2009-10-28T08:29:09Z

UE-InfoVis0910 0527037: New page: {{ns:6}}:Nina.jpg

[[{{ns:6}}:Nina.jpg]]

File:Nina.jpg

2009-10-28T08:28:41Z

UE-InfoVis0910 0527037: Nina

== Summary ==
Nina
== Copyright status ==
copyright by Nina Kickinger
== Source ==