Results 1  10
of
43
Identification Of Swirling Flow In 3D Vector Fields
, 1995
"... An algorithm for identifying the center of swirling flow in 3D discretized vector fields has been developed. The algorithm is based on critical point theory and has been implemented as a visualization tool within pV3, a package for visualizing 3D transient data. The scheme works with gridding supp ..."
Abstract

Cited by 80 (0 self)
 Add to MetaCart
An algorithm for identifying the center of swirling flow in 3D discretized vector fields has been developed. The algorithm is based on critical point theory and has been implemented as a visualization tool within pV3, a package for visualizing 3D transient data. The scheme works with gridding supported by pV3: structured meshes as well as unstructured grids composed of tetrahedra, polytetrahedral strips, hexahedra, pyramids, and/or prism cells. The results have been validated using artificiallygenerated vector fields and 3D CFD data. Introduction This work is motivated by the need to easily locate vortices in large 3D transient problems. A tool that will automatically identify such structures is definitely needed to avoid the timeconsuming and tedious task of manually examining the data. However, the question of what defines a vortex raises considerable confusion. As a result, various definitions have been proposed by investigators, including, among others, Moin and Kim [1] [2]...
Over Two Decades of IntegrationBased, Geometric Flow
 EUROGRAPHICS 2009 / M. PAULY AND G. GREINER, STAR  STATE OF THE ART REPORT
, 2009
"... Flow visualization is a fascinating subbranch of scientific visualization. With ever increasing computing power, it is possible to process ever more complex fluid simulations. However, a gap between data set sizes and our ability to visualize them remains. This is especially true for the field of f ..."
Abstract

Cited by 72 (12 self)
 Add to MetaCart
(Show Context)
Flow visualization is a fascinating subbranch of scientific visualization. With ever increasing computing power, it is possible to process ever more complex fluid simulations. However, a gap between data set sizes and our ability to visualize them remains. This is especially true for the field of flow visualization which deals with large, timedependent, multivariate simulation datasets. In this paper, geometry based flow visualization techniques form the focus of discussion. Geometric flow visualization methods place discrete objects in the vector field whose characteristics reflect the underlying properties of the flow. A great amount of progress has been made in this field over the last two decades. However, a number of challenges remain, including placement, speed of computation, and perception. In this survey, we review and classify geometric flow visualization literature according to the most important challenges when considering such a visualization, a central theme being the seeding object upon which they are based. This paper details our investigation into these techniques with discussions on their applicability and their relative merits and drawbacks. The result is an uptodate overview of the current stateoftheart that highlights both solved and unsolved problems in this rapidly evolving branch of research. It also serves as a concise introduction to the field of flow visualization research.
Ufat: a particle tracer for timedependent flow fields
 in VIS ’94: Proceedings of the conference on Visualization ’94. Los Alamitos
, 1994
"... ..."
(Show Context)
Adaptive, Multiresolution Visualization of Large Data Sets using a Distributed MemoryOctree
 in Proceedings of SC99: High Performance Networking and Computing
, 1999
"... The interactive visualization and exploration of large scientific data sets is a challenging and difficult task; their size often far exceeds the performance and memory capacity of even the most powerful graphics workstations. To address this problem, we have created a technique that combines hier ..."
Abstract

Cited by 32 (2 self)
 Add to MetaCart
(Show Context)
The interactive visualization and exploration of large scientific data sets is a challenging and difficult task; their size often far exceeds the performance and memory capacity of even the most powerful graphics workstations. To address this problem, we have created a technique that combines hierarchical data reduction methods with parallel computing to allow interactive exploration of large data sets while retaining fullresolution capability. The user may interactively change the resolution of the reduced data set either globally or by specifying a region of interest. In this way, high resolution can be obtained in local subregions without sacrificing graphics performance. We describe the software architecture of the system, give details pertaining to the use of a distributed memory octree used to create the reduced data set, and present performance results for the visualization of RayleighTaylor instability and xray burst simulation data sets. Keywords. Interactive Visua...
An Analysis of 3D Particle Path Integration Algorithms
 JOURNAL OF COMPUTATIONAL PHYSICS
, 1996
"... ..."
Interactive numerical flow visualization using stream surfaces
 Computing Systems in Engineering
, 1990
"... Threedimensional steady fluid flows are often numerically simulated over multiple overlapping curvilinear arrays of sample points. Such flows are often visualized using tangent curves or streamlines computed through the interpolated velocity field. A stream surface is the locus of an infinite numbe ..."
Abstract

Cited by 24 (0 self)
 Add to MetaCart
(Show Context)
Threedimensional steady fluid flows are often numerically simulated over multiple overlapping curvilinear arrays of sample points. Such flows are often visualized using tangent curves or streamlines computed through the interpolated velocity field. A stream surface is the locus of an infinite number of streamlines rooted at all points along a short line segment or rake. Stream surfaces can depict the structure of a flow field more effectively than is possible with mere streamline curves, but careful placement of the rakes is needed to most effectively depict the important features of the flow. I have built visualization software which supports the interactive calculation and display of stream surfaces in flow fields represented on composite curvilinear grids. This software exploits several novel methods to improve the speed with which a particle may be advected through a vector field. This is combined with a new algorithm which constructs adaptively sampled polygonal models of stream surfaces. These new methods make stream surfaces a viable tool for interactive numerical flow visualization. Software based ori these methods has been used by scientists at the
Scientific Visualization of LargeScale Unsteady Fluid Flows, Scientific Visualization: Overviews, Methodologies, and Techniques
 IEEE Computer Science Press, Los Alamitos, chapter
"... ..."
(Show Context)
Extreme scaling of production visualization software on diverse architectures
 IEEE Computer Graphics and Applications
, 2010
"... We present the results of a series of experiments studying how visualization software scales to massive data sets. Although several paradigms exist for processing large data, we focus on pure parallelism, the dominant approach for production software. These experiments utilized multiple visualizatio ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
(Show Context)
We present the results of a series of experiments studying how visualization software scales to massive data sets. Although several paradigms exist for processing large data, we focus on pure parallelism, the dominant approach for production software. These experiments utilized multiple visualization algorithms and were run on multiple architectures. Two types of experiments were performed. For the first, we examined performance at massive scale: 16,000 or more cores and one trillion or more cells. For the second, we studied weak scaling performance. These experiments were performed on the largest data set sizes published to date in visualization literature, and the findings on scaling characteristics and bottlenecks contribute to understanding of how pure parallelism will perform at high levels of concurrency and with very large data sets. 1
Vortex Identification  Applications in Aerodynamics: A Case Study
 Proceedings of IEEE Visualization ’97
, 1997
"... ..."
(Show Context)
Automatic Aerodynamic Optimization on Distributed Memory Architectures
 AIAA Paper
, 1996
"... This paper presents a parallel implementation of an automat Euler design method based on the control theory of systems governed by partial differential equations. The Euler equations and the resulting adjoint equations necessary to calculate the Frechet derivatives for t e gradient of the cost funct ..."
Abstract

Cited by 13 (7 self)
 Add to MetaCart
This paper presents a parallel implementation of an automat Euler design method based on the control theory of systems governed by partial differential equations. The Euler equations and the resulting adjoint equations necessary to calculate the Frechet derivatives for t e gradient of the cost funct2 are solved using a domain decomposit approach with communication handled by the MPI (Message Passing Interface) Standard. Parallel performance is evaluated on a distributed memory parallel computer and sample calculations are presented. A complete optimization procedure on a 1923248 mesh can be completed in 7 minutes using 16 processors of an IBM SP2 system. This clearly shows that parallel processing is a key enabling technology for CFD to become an efficient tool in a realists design environment. The parallel implementation of a mult2 lock version of the program which allows for a higher degree of geometric complexity in the design has recently been completed. Parallel performance trends of the multiblock code are consistent with the ones observed in the single block implementation.