Viscous Fingering: A Topological Visual Analytic Approach

We present a methodology to analyze and visualize an ensemble of finite pointset method (FPM) simulations that model the viscous fingering process of salt solutions inside water. In course of the simulations the solutions form structures with increased salt concentration called viscous fingers. These structures are of primary interest to domain scientists as it is not clear when and where viscous fingers appear and how they evolve. To explore the aleatoric uncertainty embedded in the simulations we analyze an ensemble of simulation runs which differ due to stochastic effects. To detect and track the viscous fingers we derive a voxel volume for each simulation where fingers are identified as subvolumes that satisfy geometrical and topological constraints. Properties and the evolution of fingers are illustrated through tracking graphs that visualize when fingers form, dissolve, merge, and split. We provide multiple linked views to compare, browse, and analyze the ensemble in real-time. Fig. 1: Detail view of our visualization tool consisting of the 3D rendering of viscous fingers (left), and the tracking graph showing their evolution (right). Fig. 2: Particle system with 1,900,000 points rendered with a diverging color map filtered by salt concentration values: all particles (left), particles above concentration 100 (middle), and particles above concentration 200 (right). Introduction Viscous fingering is an instability phenomenon that occurs in porous media at the interface between two fluids of distinct viscosity. In particular, it appears when a less viscous fluid is injected within a more viscous one. This process is prominent in many fields of science and engineering [6, 8]; including geology, hydrology, and chromatography. For instance, it plays a key role in the extraction process of oil reservoirs, and in the process of groundwater contamination. The phenomenon is characterized by the formation of a distinctive pattern called viscous fingers (Fig. 1 left). In particular, the geometrical evolution of these patterns provides good indications about the evolution of the penetration of the less viscous fluid. Thus, identifying, tracking, and analyzing the viscous fingers is of first importance for understanding the penetration process. Viscous fingering can be decomposed into three major regimes: 1. Launch: Initially, the interface between the two fluids is approximately planar. Then, the less viscous fluid starts to penetrate the more viscous one when sufficient injection force is applied to it. Viscous fingers of low and uniform amplitude start to appear in this phase. 2. Expansion: Once the reaction is launched, the difference of pressure between the two fluids tends to favor an acceleration of the penetration speed for the areas where the less viscous fluid penetrates the more viscous fluid the most. 3. Termination: Optionally, depending on the characteristics of the media and the fluids, the two fluids can eventually mix together in a termination state, where the finger pattern has completely disappeared, after finger structures merged and dissolved. We analyze an ensemble of finite pointset method (FPM) simulations that model the viscous fingering process of salt solutions inside water. FPM simulations represent a medium as a numerical point cloud where each point stores properties of the medium such as salt concentration and velocity. The ensemble was provided for the 2016 scientific visualization contest [10] and consists of 50 FPM simulations that differ due to the aleatoric uncertainty of the mixing process. Each member simulates a cylinder that is filled with pure water and contains an infinite salt supply at its top. As soon as the salt mixes with the water, the resulting solutions sink down to the bottom as they have a higher density than the surrounding water. Fig. 2 shows the points of a FPM simulation where each particle has an associated salt concentration value. In course of the simulations the solutions form structures with increased salt concentration value called viscous fingers. However, it is not clear when and where viscous fingers appear and how they evolve. Furthermore, the accuracy of the mean solution rate and properties of the fingers also depend on the point cloud resolution. The ensemble consists of 50 simulations at three resolution levels, i.e., 250k, 650k, and 1900k particles. Each simulation run provides around 100 timesteps. a) b) c) d) Fig. 3: Finger identification pipeline: starting with the voxel volume exceeding the concentration threshold (a), we compute the spatial Reeb graph of the volume (b), then filter the salt supply and noise by using said graph (c), and finally identify connected components (d). Fig. 3 shows the outline of our approach that is an extension of the methodologies proposed by Aldrich et al. [2] and Favelier et al. [7]. First, we represent the computational domain as a voxel grid and estimate the concentration density distribution for each simulation based on the their particle clouds. Next, we identify viscous fingers as voxels with increased salt concentration density, i.e., superlevel sets in the voxel grid that exceed a certain concentration level (Fig. 3a). To identify individual fingers, noise, and the salt supply, we partition the superlevel sets according to the spatial Reeb graph (Fig. 3c). Each connected component of the partitioned, filtered superlevel set is a single viscous finger (Fig. 3d). To track fingers over time we test their respective volumes for spatial overlaps in time. Finally, we visualize the evolution of the fingers with an interactive tracking graph (Fig. 1 right). Edges of the graph represent the lifespan of individual fingers, and nodes of the graph indicate the timewhen fingers appear, disappear, merge, and split. The tracking graph is linked to a 3D rendering of the particle data and a direct volume rendered image of the viscous fingers (Fig. 1 left). Users can select fingers in either view to highlight parts of the voxel volume or branches of the tree to interactively explore the evolution of fingers. We also store for each ensemble member computed metrics—such as size, integral, and bounding box—and direct volume rendered images of the viscous fingers in an image-based ensemble database that was built using the Cinema specification [1]. This database can be searched to compare specific fingers and their evolution. Furthermore, we can use the interactive tracking graph to query the database by selecting important timesteps or fingers in the graph. This enables users to effectively browse, compare, and examine the ensemble in real-time. Related Work There exists a huge body of work that demonstrates that tracking graphs are ideally suited to visualize the evolution and relation of components over time [9]. To utilize these methods we first compute a volumetric representation of the point clouds via an adaptation of Shepard’s kernel method [13] for three-dimensional domains. Several approaches have been proposed to identify and track components of such time-varying scalar fields. Components can be superlevel sets within the domain that exceed a certain level [12, 15, 5, 14, 11], or subdomains that fulfill geometrical and topological constraints [3, 4]. In our hybrid approach we compute superlevel set components and then filter components based on geometric and topological constraints. Subsequently, the extracted components can be tracked by testing for spatial overlaps in time [12, 5, 11, 15], or applying methods of topological persistence [3, 4, 16]. Specifically, to track the three-dimensional finger structures we extend the tracking algorithm proposed by Lukasczyk et al. [12] for two-dimensional grid cells. We visualize the tracked fingers, their evolution, and the relationship between individual fingers via tracking graphs [3, 5, 12, 16]. Bremer et al. [5] use tracking graphs to visualize burning cells in large-scale combustion simulations where cells are defined as areas exceeding a fuel consumption rate threshold and are tracked via spatial overlaps. Building on Bremer et al. [5], Widanagamaachchi et al. [16] propose a dynamic version of tracking graphs capable of quick graph layout updates for varying thresholds. To interactively browse and analyze the ensemble we utilize a Cinema [1] database. In general, such as database consists of pre-rendered images and pre-computed analysis results. The images and analysis results are derived for a range of parameter settings, e.g., camera angle, time, or voxel resolution. Later, a database-viewer can browse through the images and analysis results in real-time as if the results were computed at run time, i.e., emulating interactive data exploration. Data Preprocessing The ensemble consists of three sets of simulation runs (one set per resolution). Each run is represented as a time-varying particle system carrying salt concentration where the number, positions, and salt concentration values of particles vary over time. As proposed by Favelier et al. [7], we use an adaptation of Shepard’s kernel method [13] to compute for each timestep a volumetric interpolation of the particles onto a 128 grid. However, our approach allows the use of other interpolation methods. Next, the regular grid is clipped to the original shape of the domain (a cylinder) to avoid boundary effects of the interpolation. The resulting tetrahedral meshes are then passed as input to our data analysis pipeline. The advantage of this preprocessing is threefold: 1. it brings continuity to the data, which enables the usage of a larger class of analysis algorithms; 2. the input for our analysis pipeline is independent of the particle cloud resolution, and; 3. it allows for interactive renderings of each timestep based on direct volume rendering, isosurfaces, or color mapped clipped views. Finger Identification Fig. 3 shows the outline of our detection algorithm. To identify fingers within the voxel data, we start by only considering voxels that exceed a user-specified salt concentration level (Fig. 3a). From our experience, we found that a salt concentration threshold of 10 gave consistent results along timesteps and across simulation runs.We denote withL the largest connected component of this superlevel set. To filter voxels which are considered noise or belong to the salt supply we derive the spatial Reeb graph (Fig. 3b) with the method proposed by Lukasczyk et al. [12]. This graph represents the evolution of the fingers in vertical direction (z-direction) for one single timestep, i.e., the graph is a topological skeleton of the fingers and as such captures when fingers form, dissolve, merge, and break into parts while sinking. We use this graph to partition the voxel volume in z-direction and subsequently check for each component of the graph whether its associated voxels have to be filtered out. Specifically, components are identified as part of the salt supply when their xy-bounding boxes are roughly the size of the can and are located at the top of the domain. Valid fingers also have to consists of more than 8 voxels and be at least two grid cells high to filter out small bubbles and bumps, respectively. As shown in Fig. 4, although the spatial Reeb graph detects bumps at t0 and t2, they only get classified as fingers when they become significantly large enough in timesteps t1 and t4, respectively. Those criteria, however, can easily be adjusted according to the interest of the domain scientists. After filtering noise and the salt supply (Fig. 3c), we determine the connected components within the remaining voxels and assign each voxel group a unique, positive integer ID across the entire simulation (Fig. 3d). Voxels not belonging to any group have the voxel group ID -1. Furthermore, for each voxel group (finger) we store its min/max value, bounding box, number of voxels, center of mass, and the salt concentration integral over its volume. t0 t1 t2 t3 t4 Fig. 4: We use the spatial Reeb graph to filter out noise, the salt supply, and fingers that do not exceed a specified size threshold. In order to implement this approach efficiently, the concentration values are represented as a 1D floating-point array and the component ID of each voxel is stored in an additional integer array of the same size called the component matrix (CM). Both arrays are passed as data textures to aWebGL shader that performs direct volume rendering. The shader renders for a given salt concentration the iso-surfaces and colors them according to the CM (Fig. 1 left). To enhance spatial perception we also render iso-lines in z-direction, an outline of the computational domain, and use screen-space ambient occlusion. It is also possible to view and superimpose the spatial Reeb graph and the underlying particle dataset. The rendering of the particle cloud is interactive, i.e., the analyst can filter particles by salt concentration, adjust the particle sizes, and choose the color map. Moreover, the analyst can examine the mapping between the particles and their associated fingers by color coding them according to the CM. By varying the concentration threshold for the finger detection, the analyst is able to examine the impact of said threshold in real time and choose a threshold that seems appropriate to partition the particles into fingers. The computation of the CM, the direct volume rendering (512 pixels), and the rendering of the particles (512 pixels for up to one million particles) is done at interactive framerates even on devices with integrated graphic cards. Finger Tracking In order to track fingers over time, we extended the method of Lukasczyk et al. [12] to derive tracking graphs for 3D structures. Hence, nodes in the graph represent 3D volumes (the fingers) and nodes of adjacent timesteps are connected by an edge iff their respective 3D volumes overlap. Critical nodes within this graph are nodes with either no previous nodes (birth nodes), no successor nodes (death nodes), multiple predecessor nodes (merge nodes), or multiple successor nodes (split nodes). Hence, a birth node represents the first time a finger is being detected, and a death node marks the last timestep before a finger dissolves. Merge nodes represent the event of multiple fingers joining, while split nodes indicate that fingers break apart. Fig. 5 shows the tracking graph for an entire simulation run where some timesteps are linked to a corresponding DVR image of the fingers. In this illustration of the tracking graph, the x-axis represents time, and the y-axis is used to minimize edge crossings to clearly show the evolution of fingers over time by reducing occlusion. Birth and death nodes are shown as discs, while merge and split nodes are shown as diamonds. Each finger is shown in a different color where colors are passed on from the largest predecessor to the largest successor. This makes it easy to follow the history of fingers and links them to the 3D rendering. The thickness of an edge encodes some metric of its corresponding finger, e.g., its average z-position, number of voxels, integral, or length. As demonstrated in Fig. 5, the tracking graph effectively illustrates the evolution of the fingers and provides a compact overview of an ensemble member. We also provide an alternative visualization that uses the y-axis of the tracking graph to show a metric of the fingers. For example, in Fig. 6 we use the y-axis to show the average z-position of a finger for the same simulation run as in Fig. 5. This visualization enables users to effectively understand the spatial relationship between fingers. However, this representation is highly occluded, especially when the number of tracked fingers increases. Therefore, it is possible to click on an edge to highlight all components that are connected to that edge, and fade out the rest. The user can easily switch between both representations and illustratedmetrics. By clicking on nodes and edges the user can view information about the associated finger and highlight relevant volumes in the 3D rendering.