InfoVis:Wiki - User contributions [en]

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

2010-01-28T20:28:17Z

UE-InfoVis0910 0300665:

== Aufgabenstellung ==
[http://ieg.ifs.tuwien.ac.at/~gschwand/teaching/infovis_ue_ws09/infovis_ue_aufgabe3.html Beschreibung der Aufgabe 3]
=== Zu verbessernde Grafik ===
------------------------------- 
[[Image:spend.png]]

===Critics===
Again, the main point of failure is the bad readability of the graph. The eye of the reader gets distracted by the load of information viewed in circles, which are more confusing than being informal. The vertical distance between the rows of data intensify this effect. 
There are three different types of information in the graph. First, there is the absolut Spending/Income of the average US consumer. The second one is the spending per category for the average US consumer and the third one is the comparison per category and age group. The readability of the first and second type is acceptable (it's bad nevertheless), the third type shows the viewer hardly anything. The circles show the absolute amount of money spent, the number beneath the circle shows the percentage of the money the age group spent for all of the category. Because of this, the circle that's on top of the number 31,2% is much smaller than the circle above the number 26,6%. That's confusing on the one hand and on the other hand, it gives the viewer wrong information, if he just glances over the graph and doesnt take his time to decipher it. 
The caption of the columns is to far from the numbers at the end of the graph, so the viewer has to scroll up to see the caption. 
The graph should be consistent, so the 2x section confuses the viewer. 
Because of all these critics, we decided to change the graph completly.

===Redesigned Graph===
[[Image:grafik.jpg|500px]]

===Changes===
* Devided the graph into 3 smaller graphs with increased readability. 
* The first graph shows the average expenditures seperated by age group. The overall Expenditures are displayed by the red line, the total income before tax is displayed by the green line. 
* The second graph shows the absolut expenditures seperated by categories. 
* The third graph shows the same categories as the second graph, but instead of absolut expenditures, there are relative expenditures seperated within the categories by age group.

===Reredesigned Graph===
[[Image:infovis_abgabe3.jpg|500px]]

===Changes===
* Added captions to the axes 
* Renamed some captions/headings 
* Renamed the x2 section to 2x section 
* Added the source of the information 
* Decided not to delete the lines in the first graph to save the information provided by the original graph 
* Graph 1 and 3 could not be merged, because the first graph shows the absolute expenditures, the third one shows relative expenditures. The two graphs can not be compared, because the first graph shows the total expenditures of the age group and the third one shows how much of their total expenditures they spend on what categorie. 

===Rereredesigned Graph===
[[Image:infovis_abgabe3a.jpg|500px]]

===Changes===
* Added captions to the x and y-axes in the first chart 
* Removed lines and legend from first chart

File:Infovis abgabe3a.jpg

2010-01-28T20:24:19Z

UE-InfoVis0910 0300665: New page: == Summary == == Copyright status == == Source ==

== Summary ==

== Copyright status ==

== Source ==

File:Lifespan.jpg

2010-01-26T12:54:49Z

UE-InfoVis0910 0300665: New page: == Summary == == Copyright status == == Source ==

== Summary ==

== Copyright status ==

== Source ==

File:Blutlinie.jpg

2009-12-30T13:02:21Z

UE-InfoVis0910 0300665: New page: == Summary == == Copyright status == == Source ==

== Summary ==

== Copyright status ==

== Source ==

File:Stammbaum.jpg

2009-12-30T13:01:10Z

UE-InfoVis0910 0300665: New page: == Summary == == Copyright status == == Source ==

== Summary ==

== Copyright status ==

== Source ==

File:Bartmood.jpg

2009-12-30T12:52:10Z

UE-InfoVis0910 0300665: New page: == Summary == == Copyright status == == Source ==

== Summary ==

== Copyright status ==

== Source ==

Teaching talk:TUW - UE InfoVis WS 2005/06 - Gruppe 10 - Aufgabe 1 - Grid Based Layout

2009-11-06T12:25:24Z

UE-InfoVis0910 0300665:

*Rechtschreibfehler ausgebessert
*vervollständigt
*Link zu QuarkXPress ausgebessert

Teaching:TUW - UE InfoVis WS 2005/06 - Gruppe 10 - Aufgabe 1 - Grid Based Layout

2009-11-06T12:24:31Z

UE-InfoVis0910 0300665: quarkXpress link war falsch

== Definitions ==

* ''As in mathematics, the ''Layout-Grid'' can be definded as a set of regular lines, crossing eachother and therefore buildung a set of regular, consistent fields.'' Freely translated from the Original German by [Shea et al., 2005], [1]

* ''In its strictest form a ''Grid'' is literally a grid of X by Y pixels. The elements on the page are then placed on the cell border lines and overall aligned on horizontal and vertical lines.'' [Welie, 2005]

== Introduction ==

A common style over multiple pages is an important design principle. The ''Grid Based Layout'' helps the designer and the user to simplify the arrangement of several different design elements on one page. While giving layouters a common but flexible structure for placing content on the one hand, the reader is provided with a predictable surface to deal with on the other hand [Hinum, 2004].

[[Image:Grid_based_hinum1.gif|none|thumb|200px|none|Grid Based Layout Principle]]

As shown in the preceding figure, a grid has to be defined (the upper parts of the figure) which divides the layout space into several usually rectangular units according to the [http://www.sapdesignguild.org/resources/optical_illusions/gestalt_laws.html Gestalt laws] ''proximity, grouping, symetry'' and ''alignment''. Using for example the law of ''proximity'', the layouter of a web page could decide to place two grid units close by each others to let the reader see the strong semantic coherence between them. After finishing the grid layout, the content then is arranged using this grid as a mask (shown in the lower parts of the figure).

== Grid Based Layout in practice ==

''Grid Based Layout'' is not a new design principle. This section describes the history of this layout and addresses the problems occuring by transporting to other than print media.

=== History ===

''Grid Based Layout'' has it's roots in the printmedia. If you look into any newspaper or magazine you will find a very good example of a ''Grid Based Layout''. Historically seen this layout exists since the designs of Mondrian and Le Corbusier in the 1920s to 1940s. The layout was then adopted in Switzerland after the World War II and spread throughout the whole world in the 1950s and 1960s. Today ''Grid Based Layout'' is ubiquitous in commercial publications and a lot of software was developed to support this technique. For example [http://www.quark.com/ QuarkXPress] as the print industry standard, but also [http://www.adobe.com/products/pagemaker/main.html Adobe Page Maker] and [http://office.microsoft.com/en-us/FX010857941033.aspx Microsoft Publisher], which are more commonly used for desktop publishing. [Jacobs et al., 2003]

The following figure shows one example of the use of the ''Grid Based Layout'' for positioning different text blocks and images on the cover page of an university magazine:

[[Image:Cover-fall-2003-lg.gif|none|thumb|200px|none|Carleton Magazine Cover Page]]

=== Other Media ===

When trying to transport the ''Grid Based Layout'' to new media like the internet, the main problem is that designers cannot use the fixed layouts from the print media, because they have to deal with different resolutions. A web designer generally has the choice between a nice formatted version of the article - which is formatted for one specific resolution - on the one hand, and a version that flows much better on the screen, but which does not really apply to the ''Grid Based Layout'' principle any more. [Jacobs et al., 2003]

In the following figure a grid based design of a sample e-business web shop can be seen. This exemplary layout obviously shows the advantage of a common placement of units: A number of currently selected shop items are shown in a horizontal list including details like a preview picture, a short description and a price. By equally positioning theses layout units, the user is able to understand the presented information at a glance.

[[Image:Grid_based_abn-small.jpg|none|thumb|200px|left|Abn-Amro Web Shop]]
[[Image:Grid_based_audi-small.jpg|none|thumb|200px|none|Audi Nederland]]
 

The second figure shows the layout of the Audi Nederland e-commerce site presenting Audi's car models. Audi used a very clear ''Grid Based Layout'' which enables the interested user to easily navigate through the different pages and understand the presented content.

== Pros & Cons ==

* As Martijn van Welie discusses, the biggest advantage of using the ''Grid Based Layout'' is the fast recognition and understanding of the provided content by the user [Welie, 2005].

* Through choosing a commonly used layout, the management of content is easier for the content provider.

* Page designs that do not use a grid often tend to look 'messy' or 'unprofessional' [Welie, 2005].

* The biggest disadvantage of the ''Grid Based Layout'' is its inflexibility in designing creative and frequently changing layouts e.g. for fancy web sites.

== Bibliography ==

:[Shea et al., 2005] Dave Shea and Molly E. Holzschlag. ''Zen und die Kunst des CSS-Designs''. Addison-Wesley, Munich, Germany, 2005. page 138.

:[Jacobs et al., 2003] Charles Jacobs, Wilmot Lee, Evan Schrier, David Bargeron and David Salesin. Adaptive grid-based document layout. ACM Transactions on Graphics (TOG), Volume 22 , Issue 3, Special issue: Proceedings of ACM SIGGRAPH 2003:838 - 847, July 2003.

:[Hinum, 2004] Klaus Hinum, Human centred Design for Graphical User Interfaces - Practical Guidelines. Master's thesis, Vienna University of Technology, Austria, 2004. http://www.ifs.tuwien.ac.at/hinum/files/Master_Thesis_Klaus_Hinum.pdf

:[Welie, 2005] Martijn van Welie, Patterns in Interaction Design. Retrieved at Oct. 25, 2005. http://www.welie.com/patterns/showPattern.php?patternID=grid-based-layout

:[Gross, 1991] Mark D. Gross, Grids in Design and CAD. University of Colorado at Boulder, 1991. http://depts.washington.edu/dmgftp/publications/pdfs/acadia_91_mdg.pdf

== Footnotes ==

[1] {{Quotation| Wie in der Mathematik handelt es sich bei einem Layoutraster einfach um eine Reihe gleichmäßig verteilter, sich kreuzender Linien, die eine Reihe von logischen, entsprechend konsistenten Feldern bilden. | Shea and Holzman, 2005}}

Teaching talk:TUW - UE InfoVis WS 2007/08 - Gruppe 03 - Aufgabe 1 - Volume Visualization

2009-11-06T12:04:15Z

UE-InfoVis0910 0300665:

* Definitions hinzugefügt: Nützlich um einen ersten Eindruck des Begriffes zu bekommen.
* Bibliography hinzugefügt: Externe Links zu wenig Aussagekräftig. Korrekte Analyse benötigt ein Literaturverzeichnis
* Introduction anstelle von Overview of ... : Thema der Seite ist bereits bekannt und muss nicht noch mehrmals erwähnt werden.
* Rechtschreibung und Grammatikfehler ausgebessert
* External Links entfernt
* Fotos ausgetauscht wegen copyright
* Bibliographie in References umbenannt

Teaching:TUW - UE InfoVis WS 2007/08 - Gruppe 03 - Aufgabe 1 - Volume Visualization

2009-11-06T12:02:03Z

UE-InfoVis0910 0300665:

==Definitions==
*"A Survey of Algorithms for Volume Visualization", [T. Todd Elvins, 1992]

[[Image:volvis1a.jpg|200px|thumb|right|Different slices from a CT scan]]
[[Image:volvis2a.jpg|200px|thumb|right|Direct Volume Rendering]]

==Introduction==
Volume Visualization is the process of understanding multidimensional dataset by projecting it onto 2D images. Generally, the different techniques of Volume Visualization consist of projecting 3D dataset onto 2D images. Those techniques are used in many domains such as medicine, geoscience, astrophysics, chemistry, microscopy and mechanical engineering. "Computed tomography (CT) and magnetic resonance (MR) scanners can be used to create a volume by imaging a series of cross sections."[Drebin et al., 1988]. For example, with a CT scan, we obtain a lot of images which are layers of the head. After a projection, we can obtain different kinds of images, depending on what we want to see.

There are different algorithms for Volume Visualization, the basic steps for all of those algorithms are:

# Data acquisition either via empirical measurement or computer simulation.
# Put the data into a format that can be easily manipulated.
# The data is mapped onto geometric or display primitives.
# The primitives are stored, manipulated, and displayed.

==The different methods for Volume Visualization==
There are two fundamental algorithms for Volume Visualization:

# Direct volume rendering (DVR) algorithms.
# Surface-fitting (SF) algorithms.

===Direct Volume Rendering===

DVR methods map elements directly into screen space without using geometric primitives as an intermediate representation. These methods are effective with amorphous features such as clouds, fluids, and gases.These methods have one disadvantage, they need to traverse all the dataset for each rendered image, and each recalculation can be time-consuming. There is a solution to avoid this problem : the "progressive refinement". It consists of creating a low resolution image and then refining it by increasing the resolution and the quality.

===Surface-Fitting===

SF methods are also called feature-extraction or iso-surfacing and fit planar polygons or surface patches to constant-value contour surfaces. SF methods are usually faster than DVR methods since they traverse the dataset once, for a given threshold value, to obtain the surface and then conventional rendering methods (which may be in hardware) are used to produce the images. New views of the surface can be quickly generated. Using a new threshold is time-consuming since the original dataset must be traversed again.

== References ==
*[Elvins, 1992] T. Todd Elvins. ''A survey of algorithms for volume visualization''. Computer Graphics 26:3, pp. 194-201, August 1992, http://portal.acm.org/citation.cfm?id=142427
*[Drebin et al., 1988] Robert A.Drebin, Loren Carpenter, Pat Hanrahan. ''Volume Rendering''. Computer Graphics 22:4, pp. 65-74, August 1988, http://portal.acm.org/citation.cfm?id=378484.

File:Volvis1a.jpg

2009-11-06T12:00:04Z

UE-InfoVis0910 0300665: New page: == Summary == == Copyright status == Andreas Lenzhofer == Source == Andreas Lenzhofer

== Summary ==

== Copyright status ==
Andreas Lenzhofer
== Source ==
Andreas Lenzhofer

Teaching:TUW - UE InfoVis WS 2007/08 - Gruppe 03 - Aufgabe 1 - Volume Visualization

2009-11-05T23:16:21Z

UE-InfoVis0910 0300665: bild geändert da keine quellenangabe vorhanden war

==Definitions==
*"A Survey of Algorithms for Volume Visualization", [T. Todd Elvins, 1992]

[[Image:volvis1.jpg|200px|thumb|right|Different images from a CT scan]]
[[Image:volvis2a.jpg|200px|thumb|right|Direct Volume Rendering]]

==Introduction==
Volume Visualization is the process of understanding multidimensional dataset by projecting it onto 2D images. Generally, the different techniques of Volume Visualization consist of projecting 3D dataset onto 2D images. Those techniques are used in many domains such as medicine, geoscience, astrophysics, chemistry, microscopy and mechanical engineering. "Computed tomography (CT) and magnetic resonance (MR) scanners can be used to create a volume by imaging a series of cross sections."[Drebin et al., 1988] For example, with a CT scan, we obtain a lot of images which are layers of the head. After a projection, we can obtain different kinds of images, depending on what we want to see.

There are different algorithms for Volume Visualization, the basic steps for all of those algorithms are:

# Data acquisition either via empirical measurement or computer simulation.
# Put the data into a format that can be easily manipulated.
# The data is mapped onto geometric or display primitives.
# The primitives are stored, manipulated, and displayed.

==The different methods for Volume Visualization==
There are two fundamental algorithms for Volume Visualization:

# Direct volume rendering (DVR) algorithms.
# Surface-fitting (SF) algorithms.

===Direct Volume Rendering===

DVR methods map elements directly into screen space without using geometric primitives as an intermediate representation. These methods are effective with amorphous features such as clouds, fluids, and gases.These methods have one disadvantage, they need to traverse all the dataset for each rendered image, and each recalculation can be time-consuming. There is a solution to avoid this problem : the "progressive refinement". It consists of creating a low resolution image and then refining it by increasing the resolution and the quality.

===Surface-Fitting===

SF methods are also called feature-extraction or iso-surfacing and fit planar polygons or surface patches to constant-value contour surfaces. SF methods are usually faster than DVR methods since they traverse the dataset once, for a given threshold value, to obtain the surface and then conventional rendering methods (which may be in hardware) are used to produce the images. New views of the surface can be quickly generated. Using a new threshold is time-consuming since the original dataset must be traversed again.

== References ==
*[Elvins, 1992] T. Todd Elvins. ''A survey of algorithms for volume visualization''. Computer Graphics 26:3, pp. 194-201, August 1992, http://portal.acm.org/citation.cfm?id=142427
*[Drebin et al., 1988] Robert A.Drebin, Loren Carpenter, Pat Hanrahan. ''Volume Rendering''. Computer Graphics 22:4, pp. 65-74, August 1988, http://portal.acm.org/citation.cfm?id=378484.

File:Volvis2a.jpg

2009-11-05T23:12:57Z

UE-InfoVis0910 0300665: New page: == Summary == == Copyright status == == Source == [Levoy 1988] Marc Levoy, ''Display of Surfaces from Volume Data '', IEEE Computer Graphics and Applications Vol. 8 No. 3, pp. 29-37, May...

== Summary ==

== Copyright status ==

== Source ==
[Levoy 1988] Marc Levoy, ''Display of Surfaces from Volume Data '', IEEE Computer Graphics and Applications Vol. 8 No. 3, pp. 29-37, May 1988, http://graphics.stanford.edu/papers/volume-cga88/

Teaching:TUW - UE InfoVis WS 2007/08 - Gruppe 03 - Aufgabe 1 - Volume Visualization

2009-11-05T23:01:54Z

UE-InfoVis0910 0300665: Introduction umgeschrieben und Bilder formatiert, bibliographie in references umbenannt

==Definitions==
*"A Survey of Algorithms for Volume Visualization", [T. Todd Elvins, 1992]

[[Image:volvis1.jpg|200px|thumb|right|Different images from a CT scan]]
[[Image:volvis2.jpg|200px|thumb|right|Direct Volume Rendering]]

==Introduction==
Volume Visualization is the process of understanding multidimensional dataset by projecting it onto 2D images. Generally, the different techniques of Volume Visualization consist of projecting 3D dataset onto 2D images. Those techniques are used in many domains such as medicine, geoscience, astrophysics, chemistry, microscopy and mechanical engineering. "Computed tomography (CT) and magnetic resonance (MR) scanners can be used to create a volume by imaging a series of cross sections."[Drebin et al., 1988] For example, with a CT scan, we obtain a lot of images which are layers of the head. After a projection, we can obtain different kinds of images, depending on what we want to see.

There are different algorithms for Volume Visualization, the basic steps for all of those algorithms are:

# Data acquisition either via empirical measurement or computer simulation.
# Put the data into a format that can be easily manipulated.
# The data is mapped onto geometric or display primitives.
# The primitives are stored, manipulated, and displayed.

==The different methods for Volume Visualization==
There are two fundamental algorithms for Volume Visualization:

# Direct volume rendering (DVR) algorithms.
# Surface-fitting (SF) algorithms.

===Direct Volume Rendering===

DVR methods map elements directly into screen space without using geometric primitives as an intermediate representation. These methods are effective with amorphous features such as clouds, fluids, and gases.These methods have one disadvantage, they need to traverse all the dataset for each rendered image, and each recalculation can be time-consuming. There is a solution to avoid this problem : the "progressive refinement". It consists of creating a low resolution image and then refining it by increasing the resolution and the quality.

===Surface-Fitting===

SF methods are also called feature-extraction or iso-surfacing and fit planar polygons or surface patches to constant-value contour surfaces. SF methods are usually faster than DVR methods since they traverse the dataset once, for a given threshold value, to obtain the surface and then conventional rendering methods (which may be in hardware) are used to produce the images. New views of the surface can be quickly generated. Using a new threshold is time-consuming since the original dataset must be traversed again.

== References ==
*[Elvins, 1992] T. Todd Elvins. ''A survey of algorithms for volume visualization''. Computer Graphics 26:3, pp. 194-201, August 1992, http://portal.acm.org/citation.cfm?id=142427
*[Drebin et al., 1988] Robert A.Drebin, Loren Carpenter, Pat Hanrahan. ''Volume Rendering''. Computer Graphics 22:4, pp. 65-74, August 1988, http://portal.acm.org/citation.cfm?id=378484.

Teaching talk:TUW - UE InfoVis WS 2007/08 - Gruppe 03 - Aufgabe 1 - Volume Visualization

2009-10-31T14:26:26Z

UE-InfoVis0910 0300665:

Teaching:TUW - UE InfoVis WS 2007/08 - Gruppe 03 - Aufgabe 1 - Volume Visualization

2009-10-31T14:24:38Z

UE-InfoVis0910 0300665: Rechtschreibung und Grammatik ausgebessert

==Definitions==
*"A Survey of Algorithms for Volume Visualization", [T. Todd Elvins, 1992]
==Introduction==

Volume Visualization is the process of understanding multidimensional dataset by projecting it onto 2D images. Generally, the different techniques of Volume Visualization consist of projecting 3D dataset onto 2D images. Those techniques are used in many domains such as medicine, geoscience, astrophysics, chemistry, microscopy, mechanical engineering, ...

For example, with a CT scan, we obtain a lot of images which are layers of the head like on the first photo. After a projection, we can obtain different kinds of images, depending on what we want to see. We can see two different ways of the use of Volume Visualization on the second photo.

[[{{ns:6}}:volvis1.jpg|200px]] [[{{ns:6}}:volvis2.jpg|200px]]

There are different algorithms for Volume Visualization, the basic steps for all of those algorithms are:

1. Data acquisition either via empirical measurement or computer simulation.
2. Put the data into a format that can be easily manipulated.
3. The data is mapped onto geometric or display primitives.
4. The primitives are stored, manipulated, and displayed.

==The different methods for Volume Visualization==

There are two fundamental algorithms for Volume Visualization:

1. Direct volume rendering (DVR) algorithms.
2. Surface-fitting (SF) algorithms.

===Direct Volume Rendering===

DVR methods map elements directly into screen space without using geometric primitives as an intermediate representation. These methods are effective with amorphous features such as clouds, fluids, and gases.These methods have one disadvantage, they need to traverse all the dataset for each rendered image, and each recalculation can be time-consuming. There is a solution to avoid this problem : the "progressive refinement". It consists of creating a low resolution image and then refining it by increasing the resolution and the quality.

===Surface-Fitting===

SF methods are also called feature-extraction or iso-surfacing and fit planar polygons or surface patches to constant-value contour surfaces. SF methods are usually faster than DVR methods since they traverse the dataset once, for a given threshold value, to obtain the surface and then conventional rendering methods (which may be in hardware) are used to produce the images. New views of the surface can be quickly generated. Using a new threshold is time-consuming since the original dataset must be traversed again.

==External links==

[http://www.siggraph.org/education/materials/HyperVis/vistech/volume/volume.htm http://www.siggraph.org/education/materials/HyperVis/vistech/volume/volume.htm] 
[http://www.andrewwinter.com/visualization/introduction/ http://www.andrewwinter.com/visualization/introduction/] 
[http://www.cg.tuwien.ac.at/research/vis/vismed/MM/ http://www.cg.tuwien.ac.at/research/vis/vismed/MM/] 
[http://www.llnl.gov/icc/sdd/img/multiresolution.shtml http://www.llnl.gov/icc/sdd/img/multiresolution.shtml] 

==Bibliography==
[Elvins, 1992] T. Todd Elvins. ''Computer Graphics 26:3'', pp. 194-201 (August, 1992)

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

2009-10-13T16:42:34Z

UE-InfoVis0910 0300665:

== Gruppenmitglieder ==
[[User:UE-InfoVis0910_0325190|Martin, Markus]] 
Stix, Harald 
[[User:UE-InfoVis0910_0300665|Lenzhofer, Andreas]] 

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

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

2009-10-13T16:39:24Z

UE-InfoVis0910 0300665:

== Gruppenmitglieder ==
[[User:UE-InfoVis0910_0325190|Martin, Markus]] 
Stix, Harald 
[[User:UE-InfoVis0910_0300665|Lenzhofer, Andreas]]

User:UE-InfoVis0910 0300665

2009-10-13T16:15:31Z

UE-InfoVis0910 0300665: New page: Andreas Lenzhofer MatrNr: 0300665 Image:Userimage_0300665.jpg

Andreas Lenzhofer 
MatrNr: 0300665 
[[Image:Userimage_0300665.jpg]]

File:Userimage 0300665.jpg

2009-10-13T16:14:02Z

UE-InfoVis0910 0300665: New page: == Summary == == Copyright status == == Source ==