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

More documents

Recommendations

Info

Related Work2.1. Data Flow ModelsOpen Inventor comprised different data flow networks based on the following concepts:• actions & elements• field connection• engines• sensorsA so called Action traverses the scene graph storing parameters for keeping informationon the traversal state. The objects for these parameters are called Elements.Actions and Elements implement the visitor design pattern [Gam95]. The ordering ofnodes in the scene graph defines the rendering. Rendering nodes that are visited beforeothers render their content first. Some nodes only change values of the elements(property nodes) while others read the data from the elements generating 3D content(shape nodes). Special separator nodes group all sub-nodes and store the traversal statebefore processing the sub-nodes. After all sub-nodes are processed the prior traversalstate is restored by the separator node. An example of a simple scene graph is shownin figure 2.12 on page 16.Open Inventor is ideal for rapid prototyping and it comes with a file format that is anenhancement of VRML[VRM]. The Open Inventor files can be used to script an application.For further information and documentation see the Inventor Toolmaker[Wer94]and the Inventor Mentor[Wer93].A second update mechanism is also available in OpenInventor. Each node canuse several fields storing different kind of data. Two nodes at least can be linked byconnecting the fields of the nodes. Using the field connection nodes can form a fieldnetwork graph, because every time a field changes its value all nodes connected tothat field via field connection receive the update. Each node receiving the update canimplement a response that may include an update of other fields of the node leading toa recursion. Problems arising from that concept are discussed in section 3.3 on page 43.A reasonable overview on different strategies used for processing data flow networksand scene graphs was published in [ACT98].Fields can also be connected to nodes outside the scene graph called Engines. Enginesare only part of the field network graph and its concept is similar to the chain–of–responsibility design pattern[Gam95]. Engines are used to create complex connectionsbetween fields.Finally Sensors can perform scheduling of tasks triggered by specific events.Events may be an update of parts of the scene graph, like fields, nodes or sub-graphsor a certain time passed. The sensor notifies a callback function.Recently a visual programming editor was introduced for OpenInventor called CoinDesigner [Des].17
Related Work2.1. Data Flow Models2.1.7 VTK, the Visualization ToolKit [1996]Figure 2.13: Data flow model of VTK [WJSL96]: Source "S", filter "F" and mapper "M" nodes. Node "*"marks any node that may be connected to other node. Each node may have multiple connections to othernodes also known as fan–in & fan–out.The data flow model of VTK [WJSL96] (see figure 2.13) consists of Source, Filterand Mapper. Source nodes store data and are able to serve multiple output links. Filternodes can handle multiple input and output sources. VTK puts the focus onto the dataand therefore a Filter node transforms data. Mapper nodes may be linked to variousinput streams and create images, but do not produce any data output. VTK uses lazyevaluation to avoid unnecessary re–computation. The lazy evaluation concept wasintroduced by Henderson [HM76][Wad84]. There are two possible ways Filter nodescan handle data:1. A filter node operates on the existing data and all nodes linked to the output ofthe filter node reference this data as sketched in figure 2.14a) .2. The filter duplicates the input data (blue) leaving it unchanged (sketched in figure2.14b) ). The filter operates on the duplicated data (red) display on the righthand side of the filter. In that case nodes linked to the output of the filter, whichare colored red and labeled "*" use the reference to the duplicated data (red).Each node defines which kind of input or output is requested and which is optional.In other words each node defines a semantic for the link. Additional documentationon VTK is available at [VTK96][WJSL97][Sch97b]. A visual programming editor forVTK called DVA[DVA96] is also available as a commercial product.Figure 2.14: VTK Filters Data flow model [WJSL96]: Filters "F" offer two possibilities in VTK: (left) a)filter operates on input data passing references to linked nodes "*". (right) b) filter duplicates inputdata(blue). Linked output nodes "*" (red) receive reference to duplicated or altered data (red).18
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 23: Related Work2.1. Data Flow ModelsTh
Page 27 and 28: Related Work2.2. Flow Visualization
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 85 and 86:
Page 87 and 88:
Page 89 and 90:
Implementation4.5. Implementation o
Page 91 and 92:
Page 93 and 94:
Page 95 and 96:
Page 97 and 98:
Page 99 and 100:
Page 101 and 102:
Page 103 and 104:
Page 105 and 106:
Page 107 and 108:
Page 109 and 110:
Implementation4.7. CashFlow Class H
Page 111 and 112:
Implementation4.7. CashFlow Class H
Page 113 and 114:
Results5.1. Combining MultiData Nod
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 ...

Create successful ePaper yourself

Delete template?

Save as template?