@misc{PapazovHege2017, author = {Papazov, Chavdar and Hege, Hans-Christian}, title = {Blue-noise Optimized Point Sets Based on Procrustes Analysis}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-65356}, year = {2017}, abstract = {In this paper, we propose a new method for optimizing the blue noise characteristics of point sets. It is based on Procrustes analysis, a technique for adjusting shapes to each other by applying optimal elements of an appropriate transformation group. We adapt this technique to the problem at hand and introduce a very simple, efficient and provably convergent point set optimizer.}, language = {en} } @misc{MahnkeArltBaumetal.2019, 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}, year = {2019}, 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{NavaYazdaniHegevonTycowicz2019, author = {Nava-Yazdani, Esfandiar and Hege, Hans-Christian and von Tycowicz, Christoph}, title = {A Geodesic Mixed Effects Model in Kendall's Shape Space}, journal = {Proc. 7th MICCAI workshop on Mathematical Foundations of Computational Anatomy (MFCA)}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-74621}, year = {2019}, abstract = {In many applications, geodesic hierarchical models are adequate for the study of temporal observations. We employ such a model derived for manifold-valued data to Kendall's shape space. In particular, instead of the Sasaki metric, we adapt a functional-based metric, which increases the computational efficiency and does not require the implementation of the curvature tensor. We propose the corresponding variational time discretization of geodesics and apply the approach for the estimation of group trends and statistical testing of 3D shapes derived from an open access longitudinal imaging study on osteoarthritis.}, language = {en} } @misc{HegeSeebassStallingetal.1997, author = {Hege, Hans-Christian and Seebass, Martin and Stalling, Detlev and Z{\"o}ckler, Malte}, title = {A Generalized Marching Cubes Algorithm Based on Non-Binary Classifications}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-2741}, number = {SC-97-05}, year = {1997}, abstract = {We present a new technique for generating surface meshes from a uniform set of discrete samples. Our method extends the well-known marching cubes algorithm used for computing polygonal isosurfaces. While in marching cubes each vertex of a cubic grid cell is binary classified as lying above or below an isosurface, in our approach an arbitrary number of vertex classes can be specified. Consequently the resulting surfaces consist of patches separating volumes of two different classes each. Similar to the marching cubes algorithm all grid cells are traversed and classified according to the number of different vertex classes involved and their arrangement. The solution for each configuration is computed based on a model that assigns probabilities to the vertices and interpolates them. We introduce an automatic method to find a triangulation which approximates the boundary surfaces - implicitly given by our model - in a topological correct way. Look-up tables guarantee a high performance of the algorithm. In medical applications our method can be used to extract surfaces from a 3D segmentation of tomographic images into multiple tissue types. The resulting surfaces are well suited for subsequent volumetric mesh generation, which is needed for simulation as well as visualization tasks. The proposed algorithm provides a robust and unique solution, avoiding ambiguities occuring in other methods. The method is of great significance in modeling and animation too, where it can be used for polygonalization of non-manifold implicit surfaces.}, language = {en} } @misc{DeuflhardSeebassStallingetal.1997, author = {Deuflhard, Peter and Seebass, Martin and Stalling, Detlev and Beck, Rudolf and Hege, Hans-Christian}, title = {Hyperthermia Treatment Planning in Clinical Cancer Therapy: Modelling, Simulation and Visualization}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-2958}, number = {SC-97-26}, year = {1997}, abstract = {\noindent The speaker and his co-workers in Scientific Computing and Visualization have established a close cooperation with medical doctors at the Rudolf--Virchow--Klinikum of the Humboldt University in Berlin on the topic of regional hyperthermia. In order to permit a patient--specific treatment planning, a special software system ({\sf\small HyperPlan}) has been developed. \noindent A mathematical model of the clinical system ({\it radio frequency applicator with 8 antennas, water bolus, individual patient body}) involves Maxwell's equations in inhomogeneous media and a so--called bio--heat transfer PDE describing the temperature distribution in the human body. The electromagnetic field and the thermal phenomena need to be computed at a speed suitable for the clinical environment. An individual geometric patient model is generated as a quite complicated tetrahedral ``coarse'' grid (several thousands of nodes). Both Maxwell's equations and the bio--heat transfer equation are solved on that 3D--grid by means of {\em adaptive} multilevel finite element methods, which automatically refine the grid where necessary in view of the required accuracy. Finally optimal antenna parameters for the applicator are determined . \noindent All steps of the planning process are supported by powerful visualization methods. Medical images, contours, grids, simulated electromagnetic fields and temperature distributions can be displayed in combination. A number of new algorithms and techniques had to be developed and implemented. Special emphasis has been put on advanced 3D interaction methods and user interface issues.}, language = {en} } @misc{BeckDeuflhardHegeetal.1996, author = {Beck, Rudolf and Deuflhard, Peter and Hege, Hans-Christian and Seebass, Martin and Stalling, Detlev}, title = {Numerical Algorithms and Visualization in Medical Treament Planning}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-2643}, number = {SC-96-54}, year = {1996}, abstract = {After a short summary on therapy planning and the underlying technologies we discuss quantitative medicine by giving a short overview on medical image data, summarizing some applications of computer based treatment planning, and outlining requirements on medical planning systems. Then we continue with a description of our medical planning system {\sf HyperPlan}. It supports typical working steps in therapy planning, like data aquisition, segmentation, grid generation, numerical simulation and optimization, accompanying these with powerful visualization and interaction techniques.}, language = {en} } @misc{StallingZoecklerHege1997, author = {Stalling, Detlev and Z{\"o}ckler, Malte and Hege, Hans-Christian}, title = {Fast Display of Illuminated Field Lines}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-2686}, number = {SC-96-58}, year = {1997}, abstract = {A new technique for interactive vector field visualization using large numbers of properly illuminated field lines is presented. Taking into account ambient, diffuse, and specular reflection terms as well as transparency and depth cueing, we employ a realistic shading model which significantly increases quality and realism of the resulting images. While many graphics workstations offer hardware support for illuminating surface primitives, usually no means for an accurate shading of line primitives are provided. However, we show that proper illumination of lines can be implemented by exploiting the texture mapping capabilities of modern graphics hardware. In this way high rendering performance with interactive frame rates can be achieved. We apply the technique to render large numbers of integral curves of a vector field. The impression of the resulting images can be further improved by a number of visual enhancements, like transparency and depth-cueing. We also describe methods for controlling the distribution of field lines in space. These methods enable us to use illuminated field lines for interactive exploration of vector fields.}, language = {en} } @misc{BattkeStallingHege1997, author = {Battke, Henrik and Stalling, Detlev and Hege, Hans-Christian}, title = {Fast Line Integral Convolution for Arbitrary Surfaces in 3D}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-2690}, number = {SC-96-59}, year = {1997}, abstract = {We describe an extension of the line integral convolution method (LIC) for imaging of vector fields on arbitrary surfaces in 3D space. Previous approaches were limited to curvilinear surfaces, i.e.~surfaces which can be parametrized globally using 2D-coordinates. By contrast our method also handles the case of general, possibly multiply connected surfaces. The method works by tesselating a given surface with triangles. For each triangle local euclidean coordinates are defined and a local LIC texture is computed. No scaling or distortion is involved when mapping the texture onto the surface. The characteristic length of the texture remains constant. In order to exploit the texture hardware of modern graphics computers we have developed a tiling strategy for arranging a large number of triangular texture pieces within a single rectangular texture image. In this way texture memory is utilized optimally and even large textured surfaces can be explored interactively.}, language = {en} } @misc{HegeStueben1990, author = {Hege, Hans-Christian and St{\"u}ben, Hinnerk}, title = {Vectorization and Parallelization of Irregular Problems via Graph coloring.}, doi = {/10.1145/109025.109042}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-443}, number = {SC-90-16}, year = {1990}, abstract = {Efficient implementations of irregular problems on vector and parallel architectures are generally hard to realize. An important class of problems are Gauß-Seidel iteration schemes applied to irregular data sets. The unstructured data dependences arising there prevent restructuring compilers from generating efficient code for vector or parallel machines. It is shown, how to structure the data dependences by decomposing the underlying data set using graph coloring techniques and by specifying a particular execution order already on the algorithm level. Methods to master the irregularities originating from different types of tasks are proposed. An application is given and some open issues and future developments are discussed.}, language = {en} } @misc{StallingHege1995, author = {Stalling, Detlev and Hege, Hans-Christian}, title = {Fast and Resolution Independent Line Integral Convolution}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-1653}, number = {SC-94-37}, year = {1995}, abstract = {Line Integral Convolution (LIC) is a powerful technique for generating striking images and animations from vector data. Introduced in 1993, the method has rapidly found many application areas, ranging from computer arts to scientific visualization. Based upon locally filtering an input texture along a curved stream line segment in a vector field, it is able to depict directional information at high spatial resolutions. We present a new method for computing LIC images, which minimizes the total number of stream lines to be computed and thereby reduces computational costs by an order of magnitude compared to the original algorithm. Our methods utilizes fast, error-controlled numerical integrators. Decoupling the characteristic lengths in vector field grid, input texture and output image, it allows to compute filtered images at arbitrary resolution. This feature is of great significance in computer animation as well as in scientific visualization, where it can be used to explore vector data by smoothly enlarging structure of details. We also present methods for improved texture animation, employing constant filter kernels only. To obtain an optimal motion effect, spatial decay of correlation between intensities of distant pixels in the output image has to be controlled. This is achieved by blending different phase shifted box filter animations and by adaptively rescaling the contrast of the output frames.}, language = {en} } @misc{GrammelHegeWunderling1993, author = {Grammel, Martin and Hege, Hans-Christian and Wunderling, Roland}, title = {On the Impact of Communication Latencies on Distributed Sparse LU Factorization.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-1245}, number = {SC-93-28}, year = {1993}, abstract = {Sparse LU factorization offers some potential for parallelism, but at a level of very fine granularity. However, most current distributed memory MIMD architectures have too high communication latencies for exploiting all parallelism available. To cope with this, latencies must be avoided by coarsening the granularity and by message fusion. However, both techniques limit the concurrency, thereby reducing the scalability. In this paper, an implementation of a parallel LU decomposition algorithm for linear programming bases is presented for distributed memory parallel computers with noticable communication latencies. Several design decisions due to latencies, including data distribution and load balancing techniques, are discussed. An approximate performance model is set up for the algorithm, which allows to quantify the impact of latencies on its performance. Finally, experimental results for an Intel iPSC/860 parallel computer are reported and discussed.}, language = {en} } @misc{StallingZoecklerSanderetal.1998, 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}, year = {1998}, 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{BestHege1998, author = {Best, Christoph and Hege, Hans-Christian}, title = {Visualizing conformations in molecular dynamics}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-3859}, number = {SC-98-42}, year = {1998}, abstract = {The Monte Carlo simulation of the dynamics of complex molecules produces trajectories with a large number of different configurations to sample configuration space. It is expected that these configurations can be classified into a small number of conformations representing essential changes in the shape of the molecule. We present a method to visualize these conformations by point sets in the plane based on a geometrical distance measure between individual configurations. It turns out that different conformations appear as well-separated point sets. The method is further improved by performing a cluster analysis of the data set. The point-cluster representation is used to control a three-dimensional molecule viewer application to show individual configurations and conformational changes. The extraction of essential coordinates and visualization of molecular shape is discussed.}, language = {en} } @misc{KaehlerHege2003, 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}, year = {2003}, 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} } @misc{BengerHege2003, author = {Benger, Werner and Hege, Hans-Christian}, title = {Tensor Splats}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-7393}, number = {03-17}, year = {2003}, abstract = {An improved general-purpose technique for the visualization of symmetric positive definite tensor fields of rank two is described. It is based on a splatting technique that is built from tiny transparent glyph primitives which are capable to incorporate the full directional information content of a tensor. The result is an information-rich image that allows to read off the preferred directions in a tensor field at each point of a three-dimensional volume or two-dimensional surface. It is useful for analyzing slices or volumes of a three-dimensional tensor field and can be overlayed with standard volume rendering or color mapping. The application of the rendering technique is demonstrated on general relativistic data and the diffusion tensor field of a human brain.}, language = {en} } @misc{HegeHutanuKaehleretal.2003, 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}, year = {2003}, 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{BaumannHegeSchwarzetal.1996, author = {Baumann, Wolfgang and Hege, Hans-Christian and Schwarz, Uwe and St{\"u}ben, Hinnerk}, title = {Netzverteilte Visualisierung und Simulation}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-5379}, number = {TR-96-08}, year = {1996}, abstract = {Dieser Bericht beschreibt die Ergebnisse eines Anwendungsprojektes, das parallel zum Aufbau des Berliner Hochgeschwindigkeitsdatennetzes (Berlin Regional Testbed) am ZIB durchgef{\"u}hrt wurde. Es werden allgemeine Werkzeuge und anwendungsspezifische Arbeitsumgebungen zur netzverteilten Visualisierung und Simulation vorgestellt. Die allgemeinen Werkzeuge unterst{\"u}tzen folgende Aufgaben: Kopplung von Simulationen auf (Hochleistungs-)Rechnern an lokale Grafikarbeitspl{\"a}tze, objektorientierte und verteilte Visualisierung, Remote-Videoaufzeichnung, Bilddatenkompression und digitaler Filmschnitt. Die spezifischen Arbeitsumgebungen wurden f{\"u}r Aufgaben aus den Bereichen Numerische Mathematik, Astrophysik, Strukturforschung, Chemie, Polymerphysik und Str{\"o}mungsmechanik entwickelt.}, language = {de} } @misc{DeuflhardHegeSedlmayred1994, author = {Deuflhard, Peter and Hege, Hans-Christian and Sedlmayr(ed.), E.}, title = {Scientific Computing in der Theoretischen Physik. Collected Abstracts.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-5068}, number = {TR-94-01}, year = {1994}, abstract = {Die von der DMV-Fachgruppe Scientific Computing in Kooperation mit dem gleichnamigen GAMM-Fachausschuss organisierte Tagung \glqq Scientific Computing in der Theoretischen Physik\grqq~fand vom 16. - 18. M{\"a}rz 1994 am Fachbereich Mathematik und Informatik der Freien Universit{\"a}t Berlin statt. Ziel des Workshops war, die Kontakte zwischen den Fachleuten der Gebiete {\em Computational Physics} und {\em Scientific Computing} zu intensivieren. Schwerpunkte des Workshops waren numerische Simulation von Transportmodellen der Astrophysik und Halbleiterphysik, Multilevel-Methoden f{\"u}r partielle Differentialgleichungen sowie Monte-Carlo-Methoden und molekulardynamische Verfahren f{\"u}r Probleme der Statistischen Physik und Quantenfeldtheorie. Der Workshop fand ein {\"a}usserst positives Echo und f{\"u}hrte {\"u}ber 70 Teilnehmer der verschiedenen Teilgebiete der Theoretischen Physik und ca. 50 Teilnehmer aus dem Bereich der Numerischen Mathematik zusammen. \originalTeX}, language = {en} } @misc{DeuflhardHegeSeebass2000, author = {Deuflhard, Peter and Hege, Hans-Christian and Seebass, Martin}, title = {Progress Towards a Combined MRI/Hyperthermia System}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-5755}, number = {00-07}, year = {2000}, abstract = {Regional hyperthermia, a clinical cancer therapy, is the main topic of the Sonderforschungsbereich Hyperthermia: Scientific Methods and Clinical Applications'' at Berlin. In recent years, technological improvements towards a better concentration of heat to the desired target region have been achieved. These include a rather sophisticated integrated software environment for therapy planning and a new hyperthermia applicator. In a next step, a detailed closed loop monitoring of the actual treatment is to be developed. For this purpose the hyperthermia applicator is combined with an MRI system, which will allow to check the positioning of the patients and to measure individual blood perfusion as well as the 3D temperature distribution. The measurements will then be employed for an on-line control of the whole treatment. In this intended setting, new fast feedback control algorithms will come into play.}, language = {en} } @misc{HegeHoellererStalling1993, author = {Hege, Hans-Christian and H{\"o}llerer, Tobias and Stalling, Detlev}, title = {Volume Rendering - Mathematicals Models and Algorithmic Aspects.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-4994}, number = {TR-93-07}, year = {1993}, abstract = {In this paper various algorithms for rendering gaseous phenomena are reviewed. In computer graphics such algorithms are used to model natural scenes containing clouds, fog, flames and so on. On the other hand it has become an important technique in scientific visualization to display three dimensional scalar datasets as cloudy objects. Our emphasis is on this latter subject of so-called {\em direct volume rendering}. All algorithms will be discussed within the framework of linear transport theory. The equation of transfer is derived. This equation is suitable to describe the radiation field in a participating medium where absorption, emission, and scattering of light can occur. Almost all volume rendering algorithms can be shown to solve special cases of the equation of transfer. Related problems like the mapping from data values to model parameters or possible parallelization strategies will be discussed as well.}, language = {en} }