Illustrative stream surfaces

Stream surfaces are an intuitive approach to represent 3D vector fields. In many cases, however, they are challenging objects to visualize and to understand, due to a high degree of self-occlusion. Despite the need for adequate rendering methods, little work has been done so far in this important research area. In this paper, we present an illustrative rendering strategy for stream surfaces. In our approach, we apply various rendering techniques, which are inspired by the traditional flow illustrations drawn by Dallmann and Abraham \& Shaw in the early 1980s. Among these techniques are contour lines and halftoning to show the overall surface shape. Flow direction as well as singularities on the stream surface are depicted by illustrative surface streamlines. ;To go beyond reproducing static text book images, we provide several interaction features, such as movable cuts and slabs allowing an interactive exploration of the flow and insights into subjacent structures, e.g., the inner windings of vortex breakdown bubbles. These methods take only the parameterized stream surface as input, require no further preprocessing, and can be freely combined by the user. We explain the design, GPU-implementation, and combination of the different illustrative rendering and interaction methods and demonstrate the potential of our approach by applying it to stream surfaces from various flow simulations. ;     

Illustrative uncertainty visualization of DTI fiber pathways

Diffusion Tensor Imaging (DTI) and fiber tracking provide unique insight into the 3D structure of fibrous tissues in the brain. However, the output of fiber tracking contains a significant amount of uncertainty accumulated in the various steps of the processing pipeline. Existing DTI visualization methods do not present these uncertainties to the end-user. This creates a false impression of precision and accuracy that can have serious consequences in applications that rely heavily on risk assessment and decision-making, such as neurosurgery. On the other hand, adding uncertainty to an already complex visualization can easily lead to information overload and visual clutter. In this work, we propose Illustrative Confidence Intervals to reduce the complexity of the visualization and present only those aspects of uncertainty that are of interest to the user. We look specifically at the uncertainty in fiber shape due to noise and modeling errors. To demonstrate the flexibility of our framework, we compute this uncertainty in two different ways, based on (1) fiber distance and (2) the probability of a fiber connection between two brain regions. We provide the user with interactive tools to define multiple confidence intervals, specify visual styles and explore the uncertainty with a Focus+Context approach. Finally, we have conducted a user evaluation with three neurosurgeons to evaluate the added value of our visualization.     

Higher-order Voronoi diagrams on triangulated surfaces

We study the complexity of higher-order Voronoi diagrams on triangulated surfaces under the geodesic distance, when the sites may be polygonal domains of constant complexity. More precisely, we show that on a surface defined by n triangles the sum of the combinatorial complexities of the order-j Voronoi diagrams of m sites, for j=1,…,k, is O(k²n²+k²m+knm), which is asymptotically tight in the worst case.     

Anisotropic mesh adaptation for evolving triangulated surfaces

Dynamic surfaces arise in many applications, such as free surfaces in multiphase flows and moving interfaces in fluid–solid interaction. In many engineering applications, an explicit surface triangulation is often used to represent dynamic surfaces, posing significant challenges in adapting their meshes, especially if large curvatures and sharp features may dynamically emerge or vanish as the surfaces evolve. In this paper, we present an anisotropic mesh adaptation technique to meet these challenges. Our technique strives for optimal aspect ratios of the triangulation to reduce positional errors and to capture geometric features of dynamic surfaces based on a novel extension of the quadrics. Our adaptation algorithm combines the operations of vertex redistribution, edge flipping, edge contraction, and edge splitting. Experimental results demonstrate the effectiveness of our anisotropic adaptation technique for static and dynamic surfaces.     

基于模型上相邻三角面关系的纹理合成

根据模型上相邻三角面的关系,采用广度优先策略依次为每个三角面指定纹理坐标。对于具有约束面的搜索与映射过程,首先使相邻面有最小的纹理误差,最后采用图的分割技术将纹理拼接成一个连续的整体。该算法适用于任意曲面和多种纹理。     

A topological hierarchy for functions on triangulated surfaces

We combine topological and geometric methods to construct a multiresolution representation for a function over a two-dimensional domain. In a preprocessing stage, we create the Morse-Smale complex of the function and progressively simplify its topology by cancelling pairs of critical points. Based on a simple notion of dependency among these cancellations, we construct a hierarchical data structure supporting traversal and reconstruction operations similarly to traditional geometry-based representations. We use this data structure to extract topologically valid approximations that satisfy error bounds provided at runtime.     

Accelerating the computation of triangulated molecular surfaces with OpenMP

The Journal of Supercomputing - The ability to compute mesh representations of molecular surfaces in an accurate and timely manner is of great importance for applications such as implicit solvent...     

A fast robust algorithm for the intersection of triangulated surfaces

The use of discrete data to represent engineering structures as derivatives from intersecting components requires algorithms to perform Boolean operations between groups of triangulated surfaces. In the intersection process, an accurate and efficient method for the determination of intersection lines is a crucial step for large scale and complex surface intersections. An algorithm based on tracing the neighbours of intersecting triangles (TNOIT) is proposed to determine the intersection lines. Given the node numbers at the vertices of the triangles, the neighbour relationship is first established. A background grid is employed to limit the scope of searching for candidate triangles that may intersect. This will drastically reduce the time of geometrical checking for intersections between triangles, making the surface intersection and mesh generation a quasi-linear process with respect to the number of elements involved. In the determination of intersection between two triangles, four fundamental cases are identified and treated systematically to enhance robustness and reliability. Tracing the neighbours for the determination of intersection lines not only greatly increases the efficiency of the process, it also improves the reliability as branching and degenerated cases can all be dealt with in a consistent manner on the intersecting surfaces concerned. Five examples on a great variety of surface and mesh characteristics are given to demonstrate the effectiveness and robustness of the algorithm.     

Diffusion equations over arbitrary triangulated surfaces for filtering and texture applications

In computer graphics, triangular mesh representations of surfaces have become very popular. Compared with parametric and implicit forms of surfaces, triangular mesh surfaces have many advantages, such as easy to render, convenient to store and the ability to model geometric objects with arbitrary topology. In this paper, we are interested in data processing over triangular mesh surfaces through PDEs (partial differential equations). We study several diffusion equations over triangular mesh surfaces, and present corresponding numerical schemes to solve them. Our methods work for triangular mesh surfaces with arbitrary geometry (the angles of each triangle are arbitrary) and topology (open meshes or closed meshes of arbitrary genus). Besides the flexibility, our methods are efficient due to the implicit/semi-implicit time discretization. We finally apply our methods to several filtering and texture applications such as image processing, texture generating and regularization of harmonic maps over triangular mesh surfaces. The results demonstrate the flexibility and effectiveness of our methods.     

Asymmetric tensor field visualization for surfaces

Asymmetric tensor field visualization can provide important insight into fluid flows and solid deformations. Existing techniques for asymmetric tensor fields focus on the analysis, and simply use evenly-spaced hyperstreamlines on surfaces following eigenvectors and dual-eigenvectors in the tensor field. In this paper, we describe a hybrid visualization technique in which hyperstreamlines and elliptical glyphs are used in real and complex domains, respectively. This enables a more faithful representation of flow behaviors inside complex domains. In addition, we encode tensor magnitude, an important quantity in tensor field analysis, using the density of hyperstreamlines and sizes of glyphs. This allows colors to be used to encode other important tensor quantities. To facilitate quick visual exploration of the data from different viewpoints and at different resolutions, we employ an efficient image-space approach in which hyperstreamlines and glyphs are generated quickly in the image plane. The combination of these techniques leads to an efficient tensor field visualization system for domain scientists. We demonstrate the effectiveness of our visualization technique through applications to complex simulated engine fluid flow and earthquake deformation data. Feedback from domain expert scientists, who are also co-authors, is provided.     

Flow charts: visualization of vector fields on arbitrary surfaces

We introduce a novel flow visualization method called Flow Charts, which uses a texture atlas approach for the visualization of flows defined over curved surfaces. In this scheme the surface and its associated flow are segmented into overlapping patches which are then parameterized and packed in the texture domain. This scheme allows accurate particle advection across multiple charts in the texture domain, providing a flexible framework that supports various flow visualization techniques. The use of surface parameterization enables flow visualization techniques requiring the global view of the surface over long time spans, such as Unsteady Flow LIC (UFLIC), particle-based Unsteady Flow Advection-Convolution (UFAC), or dye advection. It also prevents visual artifacts normally associated with view-dependent methods. Represented as textures, Flow Charts can be naturally integrated into GPU flow visualization techniques for interactive performance.     

ISA and IBFVS: image space-based visualization of flow on surfaces

We present a side-by-side analysis of two recent image space approaches for the visualization of vector fields on surfaces. The two methods, image space advection (ISA) and image-based flow visualization for curved surfaces (IBFVS) generate dense representations of time-dependent vector fields with high spatio-temporal correlation. While the 3D vector fields are associated with arbitrary surfaces represented by triangular meshes, the generation and advection of texture properties is confined to image space. Fast frame rates are achieved by exploiting frame-to-frame coherency and graphics hardware. In our comparison of ISA and IBFVS, we point out the strengths and weaknesses of each approach and give recommendations as to when and where they are best applied.     

Interactive tensor field design and visualization on surfaces

Designing tensor fields in the plane and on surfaces is a necessary task in many graphics applications, such as painterly rendering, pen-and-ink sketching of smooth surfaces, and anisotropic remeshing. In this article, we present an interactive design system that allows a user to create a wide variety of symmetric tensor fields over 3D surfaces either from scratch or by modifying a meaningful input tensor field such as the curvature tensor. Our system converts each user specification into a basis tensor field and combines them with the input field to make an initial tensor field. However, such a field often contains unwanted degenerate points which cannot always be eliminated due to topological constraints of the underlying surface. To reduce the artifacts caused by these degenerate points, our system allows the user to move a degenerate point or to cancel a pair of degenerate points that have opposite tensor indices. These operations provide control over the number and location of the degenerate points in the field. We observe that a tensor field can be locally converted into a vector field so that there is a one-to-one correspondence between the set of degenerate points in the tensor field and the set of singularities in the vector field. This conversion allows us to effectively perform degenerate point pair cancellation and movement by using similar operations for vector fields. In addition, we adapt the image-based flow visualization technique to tensor fields, therefore allowing interactive display of tensor fields on surfaces. We demonstrate the capabilities of our tensor field design system with painterly rendering, pen-and-ink sketching of surfaces, and anisotropic remeshing     

Ptuba: a tool for the visualization of helix surfaces in proteins

Projection of transmembrane helices using a Uniform B-spline Algorithm is a tool for the visualization of interactions between helices in membrane proteins. It allows the user to generate projections of 3D helices, no matter what their deviations from a canonical helix might be. When associated with adapted coloring schemes it facilitates the comprehension of helix-helix interactions. Examples of transmembrane proteins were chosen to illustrate the advantages that this method provides. In the glycophorin A dimer we can easily appreciate the structural features behind homodimerisation. Using the structure of the fumarate reductase we analyze the contact surfaces inside a helical bundle and thanks to structures from a molecular dynamics simulation we see how modifications in structure and electrostatics relate to their interaction. We propose the use of this tool as an aid to the visualization and analysis of transmembrane helix surfaces and properties.     

Image-based rendering of intersecting surfaces for dynamic comparative visualization

Nested or intersecting surfaces are proven techniques for visualizing shape differences between static 3D objects (Weigle and Taylor II, IEEE Visualization, Proceedings, pp. 503–510, 2005). In this paper we present an image-based formulation for these techniques that extends their use to dynamic scenarios, in which surfaces can be manipulated or even deformed interactively. The formulation is based on our new layered rendering pipeline, a generic image-based approach for rendering nested surfaces based on depth peeling and deferred shading.     

Smoke surfaces: an interactive flow visualization technique inspired by real-world flow experiments

Smoke rendering is a standard technique for flow visualization. Most approaches are based on a volumetric, particle based, or image based representation of the smoke. This paper introduces an alternative representation of smoke structures: as semi-transparent streak surfaces. In order to make streak surface integration fast enough for interactive applications, we avoid expensive adaptive retriangulations by coupling the opacity of the triangles to their shapes. This way, the surface shows a smoke-like look even in rather turbulent areas. Furthermore, we show modifications of the approach to mimic smoke nozzles, wool tufts, and time surfaces. The technique is applied to a number of test data sets.