CashFlow, A Visualization Framework for 3D Flow - Studierstube ...

More documents

Recommendations

Info

Chapter 5ResultsIn the previous chapters the underlying concepts of CashFlow were introduced.Our experience shows that the full power of the scene graph in combination withscientific visualization can only be unleashed using our proposed triumvirate of Multi-Data, DataAccess and Grid node.5.1 Combining MultiData Node & DataAccess NodeTo show the full potential of the MultiData node and the DataAccess node we want tocompare four possibilities to combine these nodes. The visual result remains the samefor all four possibilities and is shown in figure 5.1. The three images in figure 5.1 showthe same set of periodic random data mapped to three different coordinate systems. Inthe left image the data is mapped to a spherical coordinate system, the middle imageshows a 2D polar coordinate system and a Cartesian coordinate system is used in theright image. In this simple visualization each grid is stored separately, generated fromthe same initial data using the same color map. The color map is also generated fromthe initial data.Figure 5.1: CashFlow basic example: A planar surface rendered using spherical (left), polar (middle) andCartesian coordinate system (right). The color map is generated from periodic random data (20x20 values)and is applied to all three grids. Figures 5.3 – 5.6 show possible simplified scene graphs generating thisvisualization. The complete corresponding scene graph to this image is show in figure 5.7 (page 106) andfigure 5.8 shows the corresponding process flow diagram.101
Results5.1. Combining MultiData Node & DataAccess NodeThe four combinations of MultiData nodes and DataAccess nodes shown infigure 5.3 – 5.6 on the previous page and in figure 5.2 on page 104 are:1. Smallest scene graph: (see figure 5.3 on page 105)The first of four scene graph consists of one MultiData node (D)[1], one DataAccessnode (A)[2] and three Render nodes (R)[3,4,5]. The three Render node[3,4,5] visualize the spherical grid, the polar and Cartesian grid shown in figure5.1 (page 101). In this simplified scene graph the traversal starts at the Separatornode (S). The MultiData node [1] and the DataAccess node [2] registerthemselves to the elements. The Render nodes [3,4,5] request the reference tothe data via the elements.It is assumed, that the MultiData node [1] and the DataAccess node [2] containthe data for the three grids. For details on how that data is inserted into the scenegraph read the next section 5.2, please.The process flow diagram in figure 5.3 (right image) shows, how the Rendernodes [3,4,5] query for the DataAccess map’s inside the DataAccess node [2].The DataAccess map contains detailed information on the virtual array (see section3.4) and a link to the MultiData node [1].This is a simple example for a basic scene graph and its process flow diagram. Itshows that though the nodes are processed by the scene graph in order [1] to [5] theprocess flow looks different. Since the render nodes request for the data is passed tothe DataAccess node first and afterwards to the MultiData node the process flow is[3] → [2] → [1]for the first Render node. This is a basic concept of CashFlow. A DataConsumer noderequests data from the DataAccess node receiving a DataAccess map that links to aMultiData node. Due to the constraint, that no new nodes shall be inserted into thescene graph during runtime by CashFlow nodes, the process flow runs reverse to thescene graph traversal for the previous mentioned nodes.Scene graph traversal:Process flow:[MultiData] → [DataAccess] → [DataConsumer]or[DataAccess] → [MultiData] → [DataConsumer][DataConsumer] → [DataAccess] → (DataAccess map) → [MultiData]One important simplification used in this section and in figure 5.3 – 5.6 is, that noGrid node was used. The intention to proceed like this is to keep the focus on the maintopic of that section, namely the abilities of MultiData nodes and DataAccess nodes.The complete scene graph corresponding to the visualization in figure 5.1 (page 101)is more complex, because it requires an additional Grid node and a Mapper node. TheGrid node will be added to the scene graph and to the process flow in the next section(see section 5.2 on page 106).102
Page 1 and 2:
D I P L O M A R B E I TCash FlowA V
Page 3 and 4:
KurzfassungDie Fusionierung von Vis
Page 5:
3.7.2 Drawback of the Virtual Array
Page 9 and 10:
Introductionis then executed using
Page 11 and 12:
Related WorkAll of these frameworks
Page 13 and 14:
Related Work2.1. Data Flow Models2.
Page 15 and 16:
Related Work2.1. Data Flow Modelspu
Page 17 and 18:
Page 19 and 20:
Page 21 and 22:
Page 23 and 24:
Related Work2.1. Data Flow ModelsTh
Page 25 and 26:
Page 27 and 28:
Related Work2.2. Flow Visualization
Page 29 and 30:
Page 31 and 32:
Page 33 and 34:
Page 35 and 36:
Page 37 and 38:
Page 39 and 40:
Page 41 and 42:
Page 43 and 44:
Page 45 and 46:
Chapter 3Software Design3.1 CashFlo
Page 47 and 48:
Software Design3.1. CashFlow Visual
Page 49 and 50:
Software Design3.2. Using the Scene
Page 51 and 52:
Software Design3.3. Indirect Refere
Page 53 and 54:
Software Design3.4. Using Virtual A
Page 55 and 56:
Software Design3.4. Using Virtual A
Page 57 and 58:
Software Design3.5. General CashFlo
Page 59 and 60:
Software Design3.6. MultiData NodeT
Page 61 and 62: Software Design3.7. DataAccess Node
Page 67 and 68: Software Design3.8. Grid Nodealgori
Page 69 and 70: Software Design3.10. Render Nodes-
Page 71 and 72: Software Design3.12. User Interacti
Page 73 and 74: Chapter 4ImplementationFigure 4.1:
Page 75 and 76: Implementation4.1. Accessing Data4.
Page 77 and 78: Implementation4.1. Accessing Data4.
Page 79 and 80: Implementation4.2. UML Inheritance
Page 81 and 82: Implementation4.3. SoMultiDataNode4
Page 83 and 84: Implementation4.4. SoDataAccessNode
Page 89 and 90: Implementation4.5. Implementation o
Page 109 and 110: Implementation4.7. CashFlow Class H
Page 111: Implementation4.7. CashFlow Class H
Page 115 and 116: Results5.1. Combining MultiData Nod
Page 117 and 118: Results5.2. CashFlow Scene Graph Ex
Page 119 and 120: Results5.2. CashFlow Scene Graph Ex
Page 121 and 122: Results5.3. Curvilinear Grid Visual
Page 123 and 124: Results5.4. Streamlines in CashFlow
Page 125 and 126: Results5.5. Grid Iterator ExamplesF
Page 127 and 128: Results5.6. Example for Parameteriz
Page 129 and 130: Results5.7. Polygonal Surfaces & Te
Page 131 and 132: Appendix AField connection &TGS Mes
Page 133 and 134: DanksagungVielen Dank an meine Schw
Page 135 and 136: 2.35 Colored Flow field topology ex
Page 137 and 138: Bibliography[3D] Java 3D. Java 3D c
Page 139 and 140: [CEI94] CEI. http://www.ceintl.com/
Page 141 and 142: [EYSK94] David S. Ebert, Roni Yagel
Page 143 and 144: [HP97] Hans - Christian Hege and Ko
Page 145 and 146: [MAY] MAYA. MAYA c○ by ALIAS c○
Page 147 and 148: [RBHC91] B. Lucas R. B. Haber and N
Page 149 and 150: [Tog02] Together. Borland R○ Toge
Page 151 and 152: [WJSV92] G. D. Montanaro William J.
Page 153 and 154: network, 39OpenDX, 15sink, 13source
Page 155: flow field, 19transfer function, 6t
show all

CashFlow, A Visualization Framework for 3D Flow - Studierstube ...

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?