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

More documents

Recommendations

Info

Implementation4.5. Implementation of SoBaseGrid4.5.1 Geometric PrimitivesIn order to separate the visualization algorithms from the grid representation we havechosen to use geometric primitives in combination with grid iterators (seesection 4.5.2). This approach was also introduced at IEEE Vis2001 tutorial 1 [Tut01]by Patrick Moran, who created the Field Model library [Mor03] implemented as aC++ template library using partial template specialization. Moran also published apaper on the field model library [Mor01].Primitives describe basic geometric properties. This concept is also known asboundary representation (B-rep) [Sam90].• Vertex [dim=0]A point in 3D.• Edge [dim=1]An edge is a connection of two vertices.• Face [dim=2]A face is created by at least three Edges and three vertices.• Cell [dim=3]A cell is a closed volumetric object, that can be described as a set of faces.4.5.2 Grid IteratorsA lot of algorithms traverse geometric primitives like the marching cubesalgorithm[LC87]. Another example are cutting planes removing parts of a geometry.These algorithms can easily be implemented by traversing the grid and checking thedistance to the cutting plane. One fundamental distinction when talking about grids isbetween regular grids and non-regular grids. Details will be provided in 2) and 3). Tosuite the needs of a large groups of algorithms we selected the following grid iterators.1. General IteratorIterators for Regular and Non-Regular Grids. Return all primitives of one kind,that is part of the grid. These iterators base on properties that all used grids havein common.2. Regular Grid IteratorThe most important property all regular grids have in common is, that the holeregular grids can be stored in one array. Information on adjacency is implicit.Only the dimensions of the grid must be known.3. Non–Regular Grid IteratorThis grid type provides no implicit adjacency information, but holds a separatelist of adjacent primitives. Sometimes even this list has to be computed fromthe raw data. Based on that data structure and the properties of that grids usefuliterators are chosen.Remark: There is a difference between non-regular grids and irregular grids.For instance the so called α-grids addressed by [Sad99] are regular grids with83
Implementation4.5. Implementation of SoBaseGridmissing cells. Based on the definition of regular grids 2) α-girds are non-regulargrids, but are not irregular grids.4.5.3 Collection of SoBaseGrid NodesThe following pages show a hierarchy of grid nodes including a brief description oftheir parameters.Figure 4.11: Polygonal Triangle grid (a) and polygonal Quad grid (b)Figure 4.12: Rectangular 2D gird (a) and rectilinear 2D grid (b)84
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: 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 89: Implementation4.5. Implementation o
Page 93 and 94: Implementation4.5. Implementation o
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?