The State of the Art in Flow Visualization: Dense and Texture-Based Techniques

Flow visualization has been a very attractive component of scientific visualization research for a long time. Usually very large multivariate datasets require processing. These datasets often consist of a large number of sample locations and several time steps. The steadily increasing performance of computers has recently become a driving factor for a reemergence in flow visualization research, especially in texture-based techniques. In this paper, dense, texture-based flow visualization techniques are discussed. This class of techniques attempts to provide a complete, dense representation of the flow field with high spatio-temporal coherency. An attempt of categorizing closely related solutions is incorporated and presented. Fundamentals are shortly addressed as well as advantages and disadvantages of the methods. Categories and Subject Descriptors (according to ACM CCS): I.3 [Computer Graphics]: visualization, flow visualization, computational flow visualizatio

PYDAC: A DISTRIBUTED RUNTIME SYSTEM AND PROGRAMMING MODEL FOR A HETEROGENEOUS MANY-CORE ARCHITECTURE

Heterogeneous many-core architectures that consist of big, fast cores and small, energy-efficient cores are very promising for future high-performance computing (HPC) systems. These architectures offer a good balance between single-threaded perfor- mance and multithreaded throughput. Such systems impose challenges on the design of programming model and runtime system. Specifically, these challenges include (a) how to fully utilize the chip’s performance, (b) how to manage heterogeneous, un- reliable hardware resources, and (c) how to generate and manage a large amount of parallel tasks. This dissertation proposes and evaluates a Python-based programming framework called PyDac. PyDac supports a two-level programming model. At the high level, a programmer creates a very large number of tasks, using the divide-and-conquer strategy. At the low level, tasks are written in imperative programming style. The runtime system seamlessly manages the parallel tasks, system resilience, and inter- task communication with architecture support. PyDac has been implemented on both an field-programmable gate array (FPGA) emulation of an unconventional het- erogeneous architecture and a conventional multicore microprocessor. To evaluate the performance, resilience, and programmability of the proposed system, several micro-benchmarks were developed. We found that (a) the PyDac abstracts away task communication and achieves programmability, (b) the micro-benchmarks are scalable on the hardware prototype, but (predictably) serial operation limits some micro-benchmarks, and (c) the degree of protection versus speed could be varied in redundant threading that is transparent to programmers

Doctor of Philosophy

dissertationIn this dissertation, we advance the theory and practice of verifying visualization algorithms. We present techniques to assess visualization correctness through testing of important mathematical properties. Where applicable, these techniques allow us to distinguish whether anomalies in visualization features can be attributed to the underlying physical process or to artifacts from the implementation under verification. Such scientific scrutiny is at the heart of verifiable visualization - subjecting visualization algorithms to the same verification process that is used in other components of the scientific pipeline. The contributions of this dissertation are manifold. We derive the mathematical framework for the expected behavior of several visualization algorithms, and compare them to experimentally observed results in the selected codes. In the Computational Science & Engineering community CS&E, this technique is know as the Method of Manufactured Solution (MMS). We apply MMS to the verification of geometrical and topological properties of isosurface extraction algorithms, and direct volume rendering. We derive the convergence of geometrical properties of isosurface extraction techniques, such as function value and normals. For the verification of topological properties, we use stratified Morse theory and digital topology to design algorithms that verify topological invariants. In the case of volume rendering algorithms, we provide the expected discretization errors for three different error sources. The results of applying the MMS is another important contribution of this dissertation. We report unexpected behavior for almost all implementations tested. In some cases, we were able to find and fix bugs that prevented the correctness of the visualization algorithm. In particular, we address an almost 2 0 -year-old bug with the core disambiguation procedure of Marching Cubes 33, one of the first algorithms intended to preserve the topology of the trilinear interpolant. Finally, an important by-product of this work is a range of responses practitioners can expect to encounter with the visualization technique under verification

Simulação numérica e visualização 3D interativa de objetos sob fluxos irrotacionais em tempo Quase-Real

Resumo: De uma maneira geral, qualquer fluxo irrotacional e incompressível é governado pela equação de Laplace. Esta não possui resolução analítica para problemas reais de engenharia, os quais possuem domínios e condições de contorno complexas, exceto para poucos casos particulares. A Dinâmica dos Fluidos Computacional (DFC) é um método utilizado para resolver numericamente a equação de Laplace, satisfazendo condições iniciais e de contorno. Porém, ao se refinar ou estender um domínio calculado, a quantidade de dados numéricos resultantes aumentará proporcionalmente e a análise destes valores pode se tornar complexa e onerosa. Complementariamente, para a compreensão dos resultados, é importante uma representação visual. A resolução numérica da equação de Laplace está descrita neste trabalho, com um algoritmo de solução inédito para as condições de contorno que atende qualquer forma geométrica em três dimensões. Desenvolveu-se um simulador que possibilita alterações geométricas de objetos 3D, calcula e visualiza interativamente velocidades, linhas de fluxo e força de sustentação para fluxos irrotacionais e incompressíveis em tempo quase-real. O sistema utiliza o método das diferenças finitas para a solução das equações. A interface gráfica foi desenvolvida utilizando, deste modo ineditamente para a DFC, a linguagem C++ e o VTK (Visualization Tool Kit). A quantidade, a origem das linhas de fluxo, a seleção do campo de velocidades, o cálculo da força de sustentação e a visualização estereoscópica são parâmetros que podem ser ajustados e selecionados para a visualização. O algoritmo passou por validações mostrando a capacidade de resolução em três dimensões. Assim, o simulador desenvolvido resolve, ao contrário dos softwares já existentes, o problema do cálculo e visualização interativa imediata ao se fazer modificações em objetos 3D. Este procedimento permitirá que se façam comparações entre formas geométricas imediatamente alteradas para que se possa escolher, entre elas, a que se adequar melhor às necessidades de um projeto

Divide and Conquer Spot Noise

The design and implementation of an interactive spot noise algorithm is presented. Spot noise is a technique which utilizes texture for the visualization of flow fields. Various design tradeoffs are discussed that allow an optimal implementation on a range of high end graphical workstations. Two applications are given: the steering of a smog prediction simulation and browsing a very large data set resulting from a direct numerical simulation of turbulence. These applications provide the motivation for the need of interactive visualization techniques. Keywords: interactive scientific visualization, flow visualization, high performance computing, atmospheric simulation, direct numerical simulation. 1 Introduction. During the last decade the need for flow visualization techniques for representing vector fields has grown substantially. The reason for this is that increasingly complex phenomena are simulated and that the resulting data sets are becoming more difficult to interpret. The vi..