@misc{StoppelHegeWiebel, author = {Stoppel, Sergej and Hege, Hans-Christian and Wiebel, Alexander}, title = {Visibility-Driven Depth Determination of Surface Patches in Direct Volume Rendering}, issn = {1438-0064}, doi = {10.2312/eurovisshort.20141164}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-50266}, abstract = {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.}, language = {en} } @misc{WiebelPreisVosetal., author = {Wiebel, Alexander and Preis, Philipp and Vos, Frans M. and Hege, Hans-Christian}, title = {Computation and Application of 3D Strokes on Visible Structures in Direct Volume Rendering}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-18070}, abstract = {In this paper we describe VisiTrace, a novel technique to draw 3D lines in 3D volume rendered images. It allows to draw strokes in the 2D space of the screen to produce 3D lines that run on top or in the center of structures actually visible in the volume rendering. It can handle structures that only shortly occlude the structure that has been visible at the starting point of the stroke and is able to ignore such structures. For this purpose a shortest path algorithm finding the optimal curve in a specially designed graph data structure is employed. We demonstrate the usefulness of the technique by applying it to MRI data from medicine and engineering, and show how the method can be used to mark or analyze structures in the example data sets, and to automatically obtain good views toward the selected structures.}, language = {en} } @misc{StallingZoecklerSanderetal., author = {Stalling, Detlev and Z{\"o}ckler, Malte and Sander, Oliver and Hege, Hans-Christian}, title = {Weighted Labels for 3D Image Segmentation}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-3828}, number = {SC-98-39}, abstract = {Segmentation tools in medical imaging are either based on editing geometric curves or on the assignment of region labels to image voxels. While the first approach is well suited to describe smooth contours at subvoxel accuracy, the second approach is conceptually more simple and guarantees a unique classification of image areas. However, contours extracted from labeled images typically exhibit strong staircase artifacts and are not well suited to represent smooth tissue boundaries. In this paper we describe how this drawback can be circumvented by supplementing region labels with additional weights. We integrated our approach into an interactive segmentation system providing a well-defined set of manual and semi-automatic editing tools. All tools update both region labels as well as the corresponding weights simultaneously, thus allowing one to define segmentation results at high resolution. We applied our techniques to generate 3D polygonal models of anatomical structures.}, language = {en} } @misc{MahnkeArltBaumetal., author = {Mahnke, Heinz-Eberhard and Arlt, Tobias and Baum, Daniel and Hege, Hans-Christian and Herter, Felix and Lindow, Norbert and Manke, Ingo and Siopi, Tzulia and Menei, Eve and Etienne, Marc and Lepper, Verena}, title = {Virtual unfolding of folded papyri}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-74338}, abstract = {The historical importance of ancient manuscripts is unique since they provide information about the heritage of ancient cultures. Often texts are hidden in rolled or folded documents. Due to recent impro- vements in sensitivity and resolution, spectacular disclosures of rolled hidden texts were possible by X-ray tomography. However, revealing text on folded manuscripts is even more challenging. Manual unfolding is often too risky in view of the fragile condition of fragments, as it can lead to the total loss of the document. X-ray tomography allows for virtual unfolding and enables non-destructive access to hid- den texts. We have recently demonstrated the procedure and tested unfolding algorithms on a mockup sample. Here, we present results on unfolding ancient papyrus packages from the papyrus collection of the Mus{\´e}e du Louvre, among them objects folded along approximately orthogonal folding lines. In one of the packages, the first identification of a word was achieved, the Coptic word for "Lord".}, language = {en} } @misc{ZoecklerStallingHege, author = {Z{\"o}ckler, Malte and Stalling, Detlev and Hege, Hans-Christian}, title = {Fast and Intuitive Generation of Geometric Shape Transitions}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-4219}, number = {SC-99-33}, abstract = {We describe a novel method for continuously transforming two triangulated models of arbitrary topology into each other. Equal global topology for both objects is assumed, extensions for genus changes during metamorphosis are provided. The proposed method addresses the major challenge in 3D metamorphosis, namely specifying the morphing process intuitively, with minimal user interaction and sufficient detail. Corresponding regions and point features are interactively identified. These regions are parametrized automatically and consistently, providing a basis for smooth interpolation. Utilizing suitable 3D interaction techniques a simple and intuitive control over the whole morphing process is offered.}, language = {en} } @misc{BengerHegeMerzkyetal., author = {Benger, Werner and Hege, Hans-Christian and Merzky, Andre and Radke, Thomas and Seidel, Edward}, title = {Efficient Distributed File I/O for Visualization in Grid Environments}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-4326}, number = {SC-99-43}, abstract = {Large scale simulations running in metacomputing environments face the problem of efficient file I/O. For efficiency it is desirable to write data locally, distributed across the computing environment, and then to minimize data transfer, i.e.\ reduce remote file access. Both aspects require I/O approaches which differ from existing paradigms. For the data output of distributed simulations, one wants to use fast local parallel I/O for all participating nodes, producing a single distributed logical file, while keeping changes to the simulation code as small as possible. For reading the data file as in postprocessing and file based visualization, one wants to have efficient partial access to remote and distributed files, using a global naming scheme and efficient data caching, and again keeping the changes to the postprocessing code small. However, all available software solutions require the entire data to be staged locally (involving possible data recombination and conversion), or suffer from the performance problems of remote or distributed file systems. In this paper we show how to interface the HDF5 I/O library via its flexible Virtual File Driver layer to the Globus Data Grid. We show, that combining these two toolkits in a suitable way provides us with a new I/O framework, which allows efficient, secure, distributed and parallel file I/O in a metacomputing environment.}, language = {en} } @misc{BengerHegeHeusler, author = {Benger, Werner and Hege, Hans-Christian and Heusler, Stefan}, title = {Visions of Numerical Relativity 1999}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-4429}, number = {SC-99-53}, abstract = {We present visualizations of recent supercomputer simulations from numerical relativity, exploiting the progress in visualization techniques and numerical methods also from an artistic point of view. The sequences have been compiled into a video tape, showing colliding black holes, orbiting and merging neutron stars as well as collapsing gravitational waves. In this paper we give some background information and provide a glance at the presented sequences.}, language = {en} } @misc{SchmidtEhrenbergHege, author = {Schmidt-Ehrenberg, Johannes and Hege, Hans-Christian}, title = {Visualizing Quantum Mechanical Phenomena}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-4287}, number = {SC-99-39}, abstract = {In this paper we discuss several ways to visualize stationary and non-stationary quantum mechanical systems. We demonstrate an approach for the quantitative interpretation of probability density isovalues which yields a reasonable correlation between isosurfaces for different timesteps. As an intuitive quantity for visualizing the momentum of a quantum system we propose the probability flow density which can be treated by vector field visualization techniques. Finally, we discuss the visualization of non-stationary systems by a sequence of single timestep images.}, language = {en} } @misc{HegeHutanuKaehleretal., author = {Hege, Hans-Christian and Hutanu, Andrei and K{\"a}hler, Ralf and Merzky, Andr{\´e} and Radke, Thomas and Seidel, Edward and Ullmer, Brygg}, title = {Progressive Retrieval and Hierarchical Visualization of Large Remote Data}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-7623}, number = {03-40}, abstract = {\noindent The size of data sets produced on remote supercomputer facilities frequently exceeds the processing capabilities of local visualization workstations. This phenomenon increasingly limits scientists when analyzing results of large-scale scientific simulations. That problem gets even more prominent in scientific collaborations, spanning large virtual organizations, working on common shared sets of data distributed in Grid environments. In the visualization community, this problem is addressed by distributing the visualization pipeline. In particular, early stages of the pipeline are executed on resources closer to the initial (remote) locations of the data sets. \noindent This paper presents an efficient technique for placing the first two stages of the visualization pipeline (data access and data filter) onto remote resources. This is realized by exploiting the ``extended retrieve'' feature of GridFTP for flexible, high performance access to very large HDF5 files. We reduce the number of network transactions for filtering operations by utilizing a server side data processing plugin, and hence reduce latency overhead compared to GridFTP partial file access. The paper further describes the application of hierarchical rendering techniques on remote uniform data sets, which make use of the remote data filtering stage.}, language = {en} } @misc{KaehlerHege, author = {K{\"a}hler, Ralf and Hege, Hans-Christian}, title = {Visualization of Time-Dependent Adaptive Mesh Refinement Data}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-7384}, number = {03-16}, abstract = {Analysis of phenomena that simultaneously occur on quite different spatial and temporal scales require adaptive, hierarchical schemes to reduce computational and storage demands. For data represented as grid functions, the key are adaptive, hierarchical, time-dependent grids that resolve spatio-temporal details without too much redundancy. Here, so-called AMR grids gain increasing popularity. For visualization and feature identification/tracking, the underlying continuous function has to be faithfully reconstructed by spatial and temporal interpolation. Well designed interpolation methods yield better results and help to reduce the amount of data to be stored. We address the problem of temporal interpolation of AMR grid data, e.g.\ for creation of smooth animations or feature tracking. Intermediate grid hierarchies are generated by merging the cells on all refinement levels that are present in the key frames considered. Utilizing a clustering algorithm a structure of nested grids is induced on the resulting collection of cells. The grid functions are mapped to the intermediate hierarchy, thus allowing application of appropriate interpolation techniques.}, language = {en} }