Sets of Globally Optimal Stream Surfaces for Flow Visualization

Stream surfaces are a well‐studied and widely used tool for the visualization of 3D flow fields. Usually, stream surface seeding is carried out manually in time‐consuming trial and error procedures. Only recently automatic selection methods were proposed. Local methods support the selection of a set of stream surfaces, but, contrary to global selection methods, they evaluate only the quality of the seeding lines but not the quality of the whole stream surfaces. Global methods, on the other hand, only support the selection of a single optimal stream surface until now. However, for certain flow fields a single stream surface is not sufficient to represent all flow features. In our work, we overcome this limitation by introducing a global selection technique for a set of stream surfaces. All selected surfaces optimize global stream surface quality measures and are guaranteed to be mutually distant, such that they can convey different flow features. Our approach is an efficient extension of the most recent global selection method for single stream surfaces. We illustrate its effectiveness on a number of analytical and simulated flow fields and analyze the quality of the results in a user study.     

Polyline‐sourced Geodesic Voronoi Diagrams on Triangle Meshes

This paper studies the Voronoi diagrams on 2‐manifold meshes based on geodesic metric (a.k.a. geodesic Voronoi diagrams or GVDs), which have polyline generators. We show that our general setting leads to situations more complicated than conventional 2D Euclidean Voronoi diagrams as well as point‐source based GVDs, since a typical bisector contains line segments, hyperbolic segments and parabolic segments. To tackle this challenge, we introduce a new concept, called local Voronoi diagram (LVD), which is a combination of additively weighted Voronoi diagram and line‐segment Voronoi diagram on a mesh triangle. We show that when restricting on a single mesh triangle, the GVD is a subset of the LVD and only two types of mesh triangles can contain GVD edges. Based on these results, we propose an efficient algorithm for constructing the GVD with polyline generators. Our algorithm runs in O(nNlogN) time and takes O(nN) space on an n‐face mesh with m generators, where N = max{m, n}. Computational results on real‐world models demonstrate the efficiency of our algorithm.     

CO_2捕捉与地质封存及泄漏监测技术现状与进展

本文介绍了CO2的捕捉和地质封存技术以及CO2封存后的环境监测技术。CO2捕捉主要包括燃烧前捕捉、燃烧后捕捉、富氧燃烧捕捉。捕捉之后需要将CO2运输到适合的地点进行封存。CO2封存技术主要包括地质封存、深海封存和矿石碳化技术。以地质封存技术为主,基于对其封存方法的分析,详述了不同地质构造(废弃油气田、地下盐水层、废弃煤层)埋存CO2后在地下的状态和不同发展阶段。CO2地下封存完成后,需要长期在地表监测泄漏情况,这也是CCS技术能够成功的关键之一,本文对相关技术的现状与进展进行了介绍。     

Spatio‐Temporal Contours from Deep Volume Raycasting

We visualize contours for spatio‐temporal processes to indicate where and when non‐continuous changes occur or spatial bounds are encountered. All time steps are comprised densely in one visualization, with contours allowing to efficiently analyze processes in the data even in case of spatial or temporal overlap. Contours are determined on the basis of deep raycasting that collects samples across time and depth along each ray. For each sample along a ray, its closest neighbors from adjacent rays are identified, considering time, depth, and value in the process. Large distances are represented as contours in image space, using color to indicate temporal occurrence. This contour representation can easily be combined with volume rendering‐based techniques, providing both full spatial detail for individual time steps and an outline of the whole time series in one view. Our view‐dependent technique supports efficient progressive computation, and requires no prior assumptions regarding the shape or nature of processes in the data. We discuss and demonstrate the performance and utility of our approach via a variety of data sets, comparison and combination with an alternative technique, and feedback by a domain scientist.     

SurgeryCuts: Embedding Additional Information in Maps without Occluding Features

Visualizing contextual information to a map often comes at the expense of overplotting issues. Especially for use cases with relevant map features in the immediate vicinity of an information to add, occlusion of the relevant map context should be avoided. We present SurgeryCuts, a map manipulation technique for the creation of additional canvas area for contextual visualizations on maps. SurgeryCuts is occlusion‐free and does not shift, zoom or alter the map viewport. Instead, relevant parts of the map can be cut apart. The affected area is controlledly distorted using a parameterizable warping function fading out the map distortion depending on the distance to the cut. We define extended metrics for our approach and compare to related approaches. As well, we demonstrate the applicability of our approach at the example of tangible use cases and a comparative user study.     

Efficient Monte Carlo rendering with realistic lenses

In this paper we present a novel approach to simulate image formation for a wide range of real world lenses in the Monte Carlo ray tracing framework. Our approach sidesteps the overhead of tracing rays through a system of lenses and requires no tabulation. To this end we first improve the precision of polynomial optics to closely match ground‐truth ray tracing. Second, we show how the Jacobian of the optical system enables efficient importance sampling, which is crucial for difficult paths such as sampling the aperture which is hidden behind lenses on both sides. Our results show that this yields converged images significantly faster than previous methods and accurately renders complex lens systems with negligible overhead compared to simple models, e.g. the thin lens model. We demonstrate the practicality of our method by incorporating it into a bidirectional path tracing framework and show how it can provide information needed for sophisticated light transport algorithms.     

Saliency‐aware Real‐time Volumetric Fusion for Object Reconstruction

We present a real‐time approach for acquiring 3D objects with high fidelity using hand‐held consumer‐level RGB‐D scanning devices. Existing real‐time reconstruction methods typically do not take the point of interest into account, and thus might fail to produce clean reconstruction results of desired objects due to distracting objects or backgrounds. In addition, any changes in background during scanning, which can often occur in real scenarios, can easily break up the whole reconstruction process. To address these issues, we incorporate visual saliency into a traditional real‐time volumetric fusion pipeline. Salient regions detected from RGB‐D frames suggest user‐intended objects, and by understanding user intentions our approach can put more emphasis on important targets, and meanwhile, eliminate disturbance of non‐important objects. Experimental results on real‐world scans demonstrate that our system is capable of effectively acquiring geometric information of salient objects in cluttered real‐world scenes, even if the backgrounds are changing.     

Web服务降级替换的一致性问题及量化研究

在开放的网络环境下,软件系统的可信性受到了更大的挑战,软件系统的降级替换是提高其可信性的方法之一。基于进程代数研究了Web服务的降级替换问题。在原有进程代数的基础上,添加了超时处理算子和延时处理算子,给出了Web服务降级替换一致性条件,从而保证了合成Web服务中降级替换的正确性。进一步地,从量化角度对Web服务的降级替换进行了研究。     

ℒ0 Gradient‐Preserving Color Transfer

This paper presents a new two‐step color transfer method which includes color mapping and detail preservation. To map source colors to target colors, which are from an image or palette, the proposed similarity‐preserving color mapping algorithm uses the similarities between pixel color and dominant colors as existing algorithms and emphasizes the similarities between source image pixel colors. Detail preservation is performed by an ?0 gradient‐preserving algorithm. It relaxes the large gradients of the sparse pixels along color region boundaries and preserves the small gradients of pixels within color regions. The proposed method preserves source image color similarity and image details well. Extensive experiments demonstrate that the proposed approach has achieved a state‐of‐art visual performance.     

Hierarchical opacity optimization for sets of 3D line fields

The selection of meaningful lines for 3D line data visualization has been intensively researched in recent years. Most approaches focus on single line fields where one line passes through each domain point. This paper presents a selection approach for sets of line fields which is based on a global optimization of the opacity of candidate lines. For this, existing approaches for single line fields are modified such that significantly larger amounts of line representatives are handled. Furthermore, time coherence is addressed for animations, making this the first approach that solves the line selection problem for 3D time‐dependent flow. We apply our technique to visualize dense sets of pathlines, sets of magnetic field lines, and animated sets of pathlines, streaklines and masslines.