Surface-based flow visualization

This is the author's peer-reviewed final manuscript, as accepted by the publisher. The published article is copyrighted by Elsevier and can be found at: http://www.journals.elsevier.com/computers-and-graphics/.With increasing computing power, it is possible to process more complex fluid simulations. However, a gap between increasing\ud data size and our ability to visualize them still remains. Despite the great amount of progress that has been made in the field of\ud flow visualization over the last two decades, a number of challenges remain. Whilst the visualization of 2D flow has many good\ud solutions, the visualization of 3D flow still poses many problems. Challenges such as domain coverage, speed of computation, and\ud perception remain key directions for further research. Flow visualization with a focus on surface-based techniques forms the basis\ud of this literature survey, including surface construction techniques and visualization methods applied to surfaces. We detail our\ud investigation into these algorithms with discussions of their applicability and their relative strengths and drawbacks. We review the\ud most important challenges when considering such visualizations. The result is an up-to-date overview of the current state-of-the-art\ud that highlights both solved and unsolved problems in this rapidly evolving branch of research

Interactive ray tracing of arbitrary implicits with SIMD interval arithmetic

Journal ArticleWe present a practical and efficient algorithm for interactively ray tracing arbitrary implicit surfaces. We use interval arithmetic (IA) both for robust root computation and guaranteed detection of topological features. In conjunction with ray tracing, this allows for rendering literally any programmable implicit function simply from its definition. Our method requires neither special hardware, nor preprocessing or storage of any data structure. Efficiency is achieved through SIMD optimization of both the interval arithmetic computation and coherent ray traversal algorithm, delivering interactive results even for complex implicit functions

Robust Feature Detection and Local Classification for Surfaces Based on Moment Analysis

The stable local classification of discrete surfaces with respect to features such as edges and corners or concave and convex regions, respectively, is as quite difficult as well as indispensable for many surface processing applications. Usually, the feature detection is done via a local curvature analysis. If concerned with large triangular and irregular grids, e.g., generated via a marching cube algorithm, the detectors are tedious to treat and a robust classification is hard to achieve. Here, a local classification method on surfaces is presented which avoids the evaluation of discretized curvature quantities. Moreover, it provides an indicator for smoothness of a given discrete surface and comes together with a built-in multiscale. The proposed classification tool is based on local zero and first moments on the discrete surface. The corresponding integral quantities are stable to compute and they give less noisy results compared to discrete curvature quantities. The stencil width for the integration of the moments turns out to be the scale parameter. Prospective surface processing applications are the segmentation on surfaces, surface comparison, and matching and surface modeling. Here, a method for feature preserving fairing of surfaces is discussed to underline the applicability of the presented approach.