@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{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{HegePolthier1995, author = {Hege, Hans-Christian and Polthier, Konrad}, title = {Visualization and Mathematics. International Workshop}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-5179}, number = {TR-95-02}, year = {1995}, abstract = {International Workshop with support of the Deutsche Forschungsgemeinschaft (DFG) and Max-Planck-Gesellschaft (MPG) Berlin (Dahlem), Germany, May 30 - June 2, 1995}, 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{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{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{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} } @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{Hege1990, author = {Hege, Hans-Christian}, title = {Datenabh{\"a}ngigkeitsanalyse und Programmtransformationen auf CRAY-Rechnern mit dem Fortran-Pr{\"a}prozessor fpp}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-4685}, number = {TR-90-04}, year = {1990}, abstract = {The FORTRAN preprocessor fpp in the newly introduced Autotasking System of CRAY Research allows automatic vectorization and parallelization on basis of a data dependence analysis. An introduction into data dependence analysis is given, showing how data dependence graphs unveil opportunities for program transformations like vectorization and concurrentization. The report contains a complete description of the preprocessors functionality, its options and directives for increasing the effectiveness of the dependence analyzer and steering the code transformations. Finally, some advice is given for the practical use of fpp on CRAY computers.}, language = {de} }