24 October 2008 in IEEE Transactions on Visualization and Computer Graphics
Data sets resulting from physical simulations typically contain a multitude of physical variables. It is, therefore, desirable that visualization methods take into account the entire multi-field volume data rather than concentrating on one variable. We present a visualization approach based on surface extraction from multi-field particle volume data. The surfaces segment the data with respect to the underlying multi-variate function. Decisions on segmentation properties are based on the analysis of the multi-dimensional feature space. The feature space exploration is performed by an automated multi-dimensional hierarchical clustering method, whose resulting density clusters are shown in the form of density level sets in a 3D star coordinate layout. In the star coordinate layout, the user can select clusters of interest. A selected cluster in feature space corresponds to a segmenting surface in object space. Based on the segmentation property induced by the cluster membership, we extract a surface from the volume data. Our driving applications are smoothed particle hydrodynamics (SPH) simulations, where each particle carries multiple properties. The data sets are given in the form of unstructured point-based volume data. We directly extract our surfaces from such data without prior resampling or grid generation. The surface extraction computes individual points on the surface, which is supported by an efficient neighborhood computation. The extracted surface points are rendered using point-based rendering operations. Our approach combines methods in scientific visualization for object-space operations with methods in information visualization for feature-space operations.
28 June 2011 in Computer Graphics Forum
19 February 2018 in The Visual Computer
24 October 2008 in IEEE Transactions on Visualization and Computer Graphics
Smooth surface extraction using partial differential equations (PDEs) is a well-known and widely used technique for visualizing volume data. Existing approaches operate on gridded data and mainly on regular structured grids. When considering unstructured point-based volume data where sample points do not form regular patterns nor are they connected in any form, one would typically resample the data over a grid prior to applying the known PDE-based methods. We propose an approach that directly extracts smooth surfaces from unstructured point-based volume data without prior resampling or mesh generation. When operating on unstructured data one needs to quickly derive neighborhood information. The respective information is retrieved by partitioning the 3D domain into cells using a fed-tree and operating on its cells. We exploit neighborhood information to estimate gradients and mean curvature at every sample point using a four-dimensional least-squares fitting approach. Gradients and mean curvature are required for applying the chosen PDE-based method that combines hyperbolic advection to an isovalue of a given scalar field and mean curvature flow. Since we are using an explicit time-integration scheme, time steps and neighbor locations are bounded to ensure convergence of the process. To avoid small global time steps, one can use asynchronous local integration. We extract a smooth surface by successively fitting a smooth auxiliary function to the data set. This auxiliary function is initialized as a signed distance function. For each sample and for every time step we compute the respective gradient, the mean curvature, and a stable time step. With these informations the auxiliary function is manipulated using an explicit Euler time integration. The process successively continues with the next sample point in time. If the norm of the auxiliary function gradient in a sample exceeds a given threshold at some time, the auxiliary function is reinitialized to a signed distance function. After convergence of the evolvution, the resulting smooth surface is obtained by extracting the zero isosurface from the auxiliary function using direct isosurface extraction from unstructured point-based volume data and rendering the extracted surface using point-based rendering methods.
1 June 2013 in Computer Graphics Forum
The operation of an airline is a very complex task and disruptions to the planned operation can occur on very short notice. Already a small disruption like a delay of some minutes can cost the airline a tremendous amount of money. Hence, it is crucial to proactively control all operations of the airline and efficiently prioritize and handle disruptions. Due to the complex setting and the need for ad hoc decisions this task can only be carried out by human operation controllers. In the field of airline operations control there exists already a vast variety of different software in productive use. We analyze the different approaches from two of the market leaders and identify problematic design choices. We take into account this analysis and develop a set of rules for an intuitive visualization of airline disruption data. Finally, we introduce our tool for visualizing such data which complies to these rules. The visualization enables the user to gain a fast overview over the current problem situation and to intuitively prioritize different problems and problem hierarchies. The efficiency of the design is evaluated with the help of a user study which shows that the new system significantly outperforms the current state of the art.
1 May 2009 in IEEE Computer Graphics and Applications
Data sets resulting from physical simulations typically contain a multitude of physical variables. So, visualization methods should take into account the entire multifield volume data rather than concentrate on one variable. We have developed a visualization approach based on surface extraction from multifield volume data. The extracted surfaces segment the data with respect to an underlying multivariate function. Decisions on segmentation properties are based on the analysis of a multidimensional feature space. We perform feature space exploration using automated multidimensional hierarchical clustering. The hierarchical clusters appear as a cluster tree in a 2D radial layout. In this layout, the user can select clusters of interest. A selected cluster in feature space corresponds to a segmenting surface in object space. On the basis of the segmentation property induced by the cluster membership, we extract surfaces from the volume data.