Refine
Document Type
- In Proceedings (6)
- ZIB-Report (4)
- In Collection (3)
- Article (1)
- Book chapter (1)
- Other (1)
Language
- English (16)
Keywords
- DVR (2)
- Interaction Techniques (1)
- Picking (1)
- Surfaces (1)
- Volume Rendering (1)
- direct volume rendering (1)
- interaction (1)
- picking (1)
- pointing (1)
Institute
- Visual Data Analysis (16) (remove)
An intuitive and sparse representation of the void space of porous materials supports the efficient analysis and visualization of interesting qualitative and quantitative parameters of such materials. We introduce definitions of the elements of this void space, here called pore space, based on its distance function, and present methods to extract these elements using the extremal structures of the distance function. The presented methods are implemented by an image processing pipeline that determines pore centers, pore paths and pore constrictions. These pore space elements build a graph that represents the topology of the pore space in a compact way. The representations we derive from μCT image data of realistic soil specimens enable the computation of many statistical parameters and, thus, provide a basis for further visual analysis and application-specific developments. We introduced parts of our pipeline in previous work. In this chapter, we present additional details and compare our results with the analytic computation of the pore space elements for a sphere packing in order to show the correctness of our graph computation.
This paper presents an algorithm called surfseek for selecting surfaces on the most visible features in direct volume rendering (DVR). The algorithm is based on a previously published technique (WYSIWYP) for picking 3D locations in DVR. The new algorithm projects a surface patch on the DVR image, consisting of multiple rays. For each ray the algorithm uses WYSIWYP or a variant of it to find the candidates for the most visible locations along the ray. Using these candidates the algorithm constructs a graph and computes a minimum cut on this graph. The minimum cut represents a visible and typically rather smooth surface. In the last step the selected surface is displayed. We provide examples for results using artificially generated and real-world data sets.
This paper presents an algorithm called surfseek for selecting surfaces
on the most visible features in direct volume rendering (DVR). The
algorithm is based on a previously published technique (WYSIWYP) for
picking 3D locations in DVR. The new algorithm projects a surface patch
on the DVR image, consisting of multiple rays. For each ray the algorithm
uses WYSIWYP or a variant of it to find the candidates for the
most visible locations along the ray. Using these candidates the algorithm
constructs a graph and computes a minimum cut on this graph. The minimum
cut represents a very visible but relatively smooth surface. In the
last step the selected surface is displayed. We provide examples for the
results in real-world dataset as well as in artificially generated datasets.