@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} } @article{BanyassadyChiuKormanetal.2019, author = {Banyassady, Bahareh and Chiu, Man-Kwun and Korman, Matias and Mulzer, Wolfgang and van Renssen, Andr{\´e} and Roeloffzen, Marcel and Seiferth, Paul and Stein, Yannik and Vogtenhuber, Birgit and Willert, Max}, title = {Routing in polygonal domains}, volume = {87}, journal = {Computational Geometry, Theory and Applications}, publisher = {Elsevier}, doi = {10.1016/j.comgeo.2019.101593}, year = {2019}, abstract = {We consider the problem of routing a data packet through the visibility graph of a polygonal domain P with n vertices and h holes. We may preprocess P to obtain a "label" and a "routing table" for each vertex of P. Then, we must be able to route a data packet between any two vertices p and q of P, where each step must use only the label of the target node q and the routing table of the current node. For any fixed epsilon > 0, we present a routing scheme that always achieves a routing path whose length exceeds the shortest path by a factor of at most 1 + epsilon. The labels have O(log n) bits, and the routing tables are of size O(((epsilon^-1)+h)log n). The preprocessing time is O((n^2)log n). It can be improved to O(n^2) for simple polygons.}, language = {en} } @article{BanyassadyBarbaMulzer2020, author = {Banyassady, Bahareh and Barba, Luis and Mulzer, Wolfgang}, title = {Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees}, volume = {11(1)}, journal = {Journal of Computational Geometry (JoCG)}, url = {http://nbn-resolving.de/https://jocg.org/index.php/jocg/article/view/473}, pages = {525 -- 547}, year = {2020}, abstract = {We present time-space trade-offs for computing the Euclidean minimum spanning tree of a set S of n point-sites in the plane. More precisely, we assume that S resides in a random-access memory that can only be read. The edges of the Euclidean minimum spanning tree EMST(S) have to be reported sequentially, and they cannot be accessed or modified afterwards. There is a parameter s in {1, ..., n} so that the algorithm may use O(s) cells of read-write memory (called the workspace) for its computations. Our goal is to find an algorithm that has the best possible running time for any given s between 1 and n. We show how to compute EMST(S) in O(((n^3)/(s^2)) log s) time with O(s) cells of workspace, giving a smooth trade-off between the two best-known bounds O(n^3) for s = 1 and O(n log n) for s = n. For this, we run Kruskal's algorithm on the "relative neighborhood graph" (RNG) of S. It is a classic fact that the minimum spanning tree of RNG(S) is exactly EMST(S). To implement Kruskal's algorithm with O(s) cells of workspace, we define s-nets, a compact representation of planar graphs. This allows us to efficiently maintain and update the components of the current minimum spanning forest as the edges are being inserted.}, language = {en} } @inproceedings{PapazovHege2017, author = {Papazov, Chavdar and Hege, Hans-Christian}, title = {Blue-noise Optimized Point Sets Based on Procrustes Analysis}, booktitle = {SIGGRAPH Asia 2017 Technical Briefs}, doi = {10.1145/3145749.3149442}, pages = {20:1 -- 20:4}, year = {2017}, language = {en} } @article{OeltzeJaffraMeuschkeNeugebaueretal.2019, author = {Oeltze-Jaffra, Steffen and Meuschke, Monique and Neugebauer, Mathias and Saalfeld, Sylvia and Lawonn, Kai and Janiga, Gabor and Hege, Hans-Christian and Zachow, Stefan and Preim, Bernhard}, title = {Generation and Visual Exploration of Medical Flow Data: Survey, Research Trends, and Future Challenges}, volume = {38}, journal = {Computer Graphics Forum}, number = {1}, publisher = {Wiley}, doi = {10.1111/cgf.13394}, pages = {87 -- 125}, year = {2019}, abstract = {Simulations and measurements of blood and air flow inside the human circulatory and respiratory system play an increasingly important role in personalized medicine for prevention, diagnosis, and treatment of diseases. This survey focuses on three main application areas. (1) Computational Fluid Dynamics (CFD) simulations of blood flow in cerebral aneurysms assist in predicting the outcome of this pathologic process and of therapeutic interventions. (2) CFD simulations of nasal airflow allow for investigating the effects of obstructions and deformities and provide therapy decision support. (3) 4D Phase-Contrast (4D PC) Magnetic Resonance Imaging (MRI) of aortic hemodynamics supports the diagnosis of various vascular and valve pathologies as well as their treatment. An investigation of the complex and often dynamic simulation and measurement data requires the coupling of sophisticated visualization, interaction, and data analysis techniques. In this paper, we survey the large body of work that has been conducted within this realm. We extend previous surveys by incorporating nasal airflow, addressing the joint investigation of blood flow and vessel wall properties, and providing a more fine-granular taxonomy of the existing techniques. From the survey, we extract major research trends and identify open problems and future challenges. The survey is intended for researchers interested in medical flow but also more general, in the combined visualization of physiology and anatomy, the extraction of features from flow field data and feature-based visualization, the visual comparison of different simulation results, and the interactive visual analysis of the flow field and derived characteristics.}, language = {en} } @article{KramerNoackBaumetal.2018, author = {Kramer, Tobias and Noack, Matthias and Baum, Daniel and Hege, Hans-Christian and Heller, Eric J.}, title = {Dust and gas emission from cometary nuclei: the case of comet 67P/Churyumov-Gerasimenko}, volume = {3}, journal = {Advances in Physics: X}, number = {1}, doi = {10.1080/23746149.2017.1404436}, pages = {1404436}, year = {2018}, abstract = {Comets display with decreasing solar distance an increased emission of gas and dust particles, leading to the formation of the coma and tail. Spacecraft missions provide insight in the temporal and spatial variations of the dust and gas sources located on the cometary nucleus. For the case of comet 67P/Churyumov-Gerasimenko (67P/C-G), the long-term obser- vations from the Rosetta mission point to a homogeneous dust emission across the entire illuminated surface. Despite the homogeneous initial dis- tribution, a collimation in jet-like structures becomes visible. We propose that this observation is linked directly to the complex shape of the nucleus and projects concave topographical features into the dust coma. To test this hypothesis, we put forward a gas-dust description of 67P/C-G, where gravitational and gas forces are accurately determined from the surface mesh and the rotation of the nucleus is fully incorporated. The emerging jet-like structures persist for a wide range of gas-dust interactions and show a dust velocity dependent bending.}, language = {en} } @inproceedings{SakuraiHegeKuhnetal.2017, author = {Sakurai, Daisuke and Hege, Hans-Christian and Kuhn, Alexander and Rust, Henning and Kern, Bastian and Breitkopf, Tom-Lukas}, title = {An Application-Oriented Framework for Feature Tracking in Atmospheric Sciences}, booktitle = {Proceedings of 2017 IEEE 7th Symposium on Large Data Analysis and Visualization (LDAV)}, doi = {10.1109/LDAV.2017.8231857}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-66685}, pages = {96 -- 97}, year = {2017}, abstract = {In atmospheric sciences, sizes of data sets grow continuously due to increasing resolutions. A central task is the comparison of spatiotemporal fields, to assess different simulations and to compare simulations with observations. A significant information reduction is possible by focusing on geometric-topological features of the fields or on derived meteorological objects. Due to the huge size of the data sets, spatial features have to be extracted in time slices and traced over time. Fields with chaotic component, i.e. without 1:1 spatiotemporal correspondences, can be compared by looking upon statistics of feature properties. Feature extraction, however, requires a clear mathematical definition of the features - which many meteorological objects still lack. Traditionally, object extractions are often heuristic, defined only by implemented algorithms, and thus are not comparable. This work surveys our framework designed for efficient development of feature tracking methods and for testing new feature definitions. The framework supports well-established visualization practices and is being used by atmospheric researchers to diagnose and compare data.}, language = {en} } @article{WilliePapPerkaetal.2015, author = {Willie, Bettina M. and Pap, Thomas and Perka, Carsten and Schmidt, Carsten Oliver and Eckstein, Felix and Arampatzis, Adamantios and Hege, Hans-Christian and Madry, Henning and Vortkamp, Andrea and Duda, Georg}, title = {OVERLOAD of joints and its role in osteoarthritis - Towards understanding and preventing progression of primary osteoarthritis}, volume = {76}, journal = {Zeitschrift f{\"u}r Rheumatologie}, number = {Suppl. 1}, doi = {10.1007/s00393-014-1561-2}, pages = {1 -- 4}, year = {2015}, abstract = {Intact joints are necessary for skeletal function and mobility in daily life. A healthy musculoskeletal system is the basis for a functional cardiovascular system as well as an intact immune system. Locomotion, physiotherapy, and various forms of patient activity are essential clinical therapies used in the treatment of neurodegeneration, stroke, diabetes, and cancer. Mobility is substantially impaired with degeneration of joints and, in advanced stages, nighttime pain and sleep disturbance are particularly cumbersome. Osteoarthritis (OA) is also known as degenerative joint disease. OA involves structural and compositional changes in the articular cartilage, as well as in the calcified cartilage, subchondral cortical bone, subchondral cancellous bone, meniscus, joint capsular tissue, and synovium; which eventually lead to degeneration of these tissues comprising synovial joints.}, language = {en} } @article{GuentherKuhnHegeetal.2017, author = {G{\"u}nther, Tobias and Kuhn, Alexander and Hege, Hans-Christian and Gross, Markus and Theisel, Holger}, title = {Progressive Monte Carlo rendering of atmospheric flow features across scales}, volume = {2}, journal = {Physical Review Fluids}, doi = {10.1103/PhysRevFluids.2.090502}, pages = {09050-1 -- 09050-3}, year = {2017}, abstract = {To improve existing weather prediction and reanalysis capabilities, high-resolution and multi-modal climate data becomes an increasingly important topic. The advent of increasingly dense numerical simulation of atmospheric phenomena, provides new means to better understand dynamic processes and to visualize structural flow patterns that remain hidden otherwise. In the presented illustrations we demonstrate an advanced technique to visualize multiple scales of dense flow fields and Lagrangian patterns therein, simulated by state-of-the-art simulation models for each scale. They provide a deeper insight into the structural differences and patterns that occur on each scale and highlight the complexity of flow phenomena in our atmosphere. This paper is associated with a poster winner of a 2016 APS/DFD Milton van Dyke Award for work presented at the DFD Gallery of Fluid Motion. The original poster is available from the Gallery of Fluid Motion, https://doi.org/10.1103/APS.DFD.2016.GFM.P0030}, language = {en} } @article{MahnkeArltBaumetal.2020, 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}, volume = {41}, journal = {Journal of Cultural Heritage}, publisher = {Elsevier}, doi = {10.1016/j.culher.2019.07.007}, pages = {264 -- 269}, year = {2020}, 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} } @inproceedings{FroehlerdaCunhaMeloWeissenboecketal.2019, author = {Fr{\"o}hler, Bernhard and da Cunha Melo, Lucas and Weissenb{\"o}ck, Johannes and Kastner, Johann and M{\"o}ller, Torsten and Hege, Hans-Christian and Gr{\"o}ller, Eduard M. and Sanctorum, Jonathan and De Beenhouwer, Jan and Sijbers, Jan and Heinzl, Christoph}, title = {Tools for the analysis of datasets from X-ray computed tomography based on Talbot-Lau grating interferometry}, booktitle = {Proceedings of iCT 2019, (9th Conference on Industrial Computed Tomography, Padova, Italy - iCT 2019, February 13-15, 2019)}, number = {paper 52}, pages = {8}, year = {2019}, abstract = {This work introduces methods for analyzing the three imaging modalities delivered by Talbot-Lau grating interferometry X-ray computed tomography (TLGI-XCT). The first problem we address is providing a quick way to show a fusion of all three modal- ities. For this purpose the tri-modal transfer function widget is introduced. The widget controls a mixing function that uses the output of the transfer functions of all three modalities, allowing the user to create one customized fused image. A second problem prevalent in processing TLGI-XCT data is a lack of tools for analyzing the segmentation process of such multimodal data. We address this by providing methods for computing three types of uncertainty: From probabilistic segmentation algorithms, from the voxel neighborhoods as well as from a collection of results. We furthermore introduce a linked views interface to explore this data. The techniques are evaluated on a TLGI-XCT scan of a carbon-fiber reinforced dataset with impact damage. We show that the transfer function widget accelerates and facilitates the exploration of this dataset, while the uncertainty analysis methods give insights into how to tweak and improve segmentation algorithms for more suitable results.}, language = {en} } @article{GoubergritsHellmeierBrueningetal.2019, author = {Goubergrits, Leonid and Hellmeier, Florian and Bruening, Jan Joris and Spuler, Andreas and Hege, Hans-Christian and Voss, Samuel and Janiga, G{\´a}bor and Saalfeld, Sylvia and Beuing, Oliver and Berg, Philipp}, title = {Multiple Aneurysms AnaTomy CHallenge 2018 (MATCH): Uncertainty Quantification of Geometric Rupture Risk Parameters}, volume = {18}, journal = {BioMedical Engineering OnLine}, number = {35}, doi = {10.1186/s12938-019-0657-y}, year = {2019}, abstract = {Background Geometric parameters have been proposed for prediction of cerebral aneurysm rupture risk. Predicting the rupture risk for incidentally detected unruptured aneurysms could help clinicians in their treatment decision. However, assessment of geometric parameters depends on several factors, including the spatial resolution of the imaging modality used and the chosen reconstruction procedure. The aim of this study was to investigate the uncertainty of a variety of previously proposed geometric parameters for rupture risk assessment, caused by variability of reconstruction procedures. Materials 26 research groups provided segmentations and surface reconstructions of five cerebral aneurysms as part of the Multiple Aneurysms AnaTomy CHallenge (MATCH) 2018. 40 dimensional and non-dimensional geometric parameters, describing aneurysm size, neck size, and irregularity of aneurysm shape, were computed. The medians as well as the absolute and relative uncertainties of the parameters were calculated. Additionally, linear regression analysis was performed on the absolute uncertainties and the median parameter values. Results A large variability of relative uncertainties in the range between 3.9 and 179.8\% was found. Linear regression analysis indicates that some parameters capture similar geometric aspects. The lowest uncertainties < 6\% were found for the non-dimensional parameters isoperimetric ratio, convexity ratio, and ellipticity index. Uncertainty of 2D and 3D size parameters was significantly higher than uncertainty of 1D parameters. The most extreme uncertainties > 80\% were found for some curvature parameters. Conclusions Uncertainty analysis is essential on the road to clinical translation and use of rupture risk prediction models. Uncertainty quantification of geometric rupture risk parameters provided by this study may help support development of future rupture risk prediction models.}, language = {en} } @article{FroehlerElberfeldMoelleretal.2019, author = {Fr{\"o}hler, Bernhard and Elberfeld, Tim and M{\"o}ller, Torsten and Hege, Hans-Christian and Weissenb{\"o}ck, Johannes and De Beenhouwer, Jan and Sijbers, Jan and Kastner, Johann and Heinzl, Christoph}, title = {A Visual Tool for the Analysis of Algorithms for Tomographic Fiber Reconstruction in Materials Science}, volume = {38}, journal = {Computer Graphics Forum}, number = {3}, doi = {10.1111/cgf.13688}, pages = {273 -- 283}, year = {2019}, abstract = {We present visual analysis methods for the evaluation of tomographic fiber reconstruction algorithms by means of analysis, visual debugging and comparison of reconstructed fibers in materials science. The methods are integrated in a tool (FIAKER) that supports the entire workflow. It enables the analysis of various fiber reconstruction algorithms, of differently parameterized fiber reconstruction algorithms and of individual steps in iterative fiber reconstruction algorithms. Insight into the performance of fiber reconstruction algorithms is obtained by a list-based ranking interface. A 3D view offers interactive visualization techniques to gain deeper insight, e.g., into the aggregated quality of the examined fiber reconstruction algorithms and parameterizations. The tool was designed in close collaboration with researchers who work with fiber-reinforced polymers on a daily basis and develop algorithms for tomographic reconstruction and characterization of such materials. We evaluate the tool using synthetic datasets as well as tomograms of real materials. Five case studies certify the usefulness of the tool, showing that it significantly accelerates the analysis and provides valuable insights that make it possible to improve the fiber reconstruction algorithms. The main contribution of the paper is the well-considered combination of methods and their seamless integration into a visual tool that supports the entire workflow. Further findings result from the analysis of (dis-)similarity measures for fibers as well as from the discussion of design decisions. It is also shown that the generality of the analytical methods allows a wider range of applications, such as the application in pore space analysis.}, 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} } @article{PoethkowPetzHege2013, author = {P{\"o}thkow, Kai and Petz, Christoph and Hege, Hans-Christian}, title = {Approximate Level-Crossing Probabilities for Interactive Visualization of Uncertain Isocontours}, volume = {3}, journal = {International Journal for Uncertainty Quantification}, number = {2}, doi = {10.1615/Int.J.UncertaintyQuantification.2012003958}, pages = {101 -- 117}, year = {2013}, language = {en} } @inproceedings{KochWiebelKastenetal.2013, author = {Koch, Stefan and Wiebel, Alexander and Kasten, Jens and Hlawitschka, Mario}, title = {Visualizing Linear Neighborhoods in Non-Linear Vector Fields}, booktitle = {Proceedings of the IEEE Pacific Visualization Symposium}, address = {Sydney, Australia}, pages = {249 -- 256}, year = {2013}, language = {en} } @misc{HombergBaumWiebeletal.2014, author = {Homberg, Ulrike and Baum, Daniel and Wiebel, Alexander and Prohaska, Steffen and Hege, Hans-Christian}, title = {Definition, Extraction, and Validation of Pore Structures in Porous Materials}, journal = {Topological Methods in Data Analysis and Visualization III}, editor = {Bremer, Peer-Timo and Hotz, Ingrid and Pascucci, Valerio and Peikert, Ronald}, publisher = {Springer}, doi = {10.1007/978-3-319-04099-8_15}, pages = {235 -- 248}, year = {2014}, language = {en} } @misc{ZobelReininghausHotz2013, author = {Zobel, Valentin and Reininghaus, Jan and Hotz, Ingrid}, title = {Visualization of Two-Dimensional Symmetric Tensor Fields Using the Heat Kernel Signature}, journal = {Topological Methods in Data Analysis and Visualization III}, address = {Davis, CA, USA}, pages = {249 -- 262}, year = {2013}, language = {en} } @inproceedings{KlindtProhaskaBaumetal.2012, author = {Klindt, Marco and Prohaska, Steffen and Baum, Daniel and Hege, Hans-Christian}, title = {Conveying Archaeological Contexts to Museum Visitors: Case Study Pergamon Exhibition}, booktitle = {VAST12: The 13th International Symposium on Virtual Reality, Archaeology and Intelligent Cultural Heritage - Short Papers}, editor = {Arnold, David and Kaminski, Jaime and Niccolucci, Franco and Stork, Andre}, publisher = {Eurographics Association}, address = {Brighton, UK}, doi = {10.2312/PE/VAST/VAST12S/025-028}, pages = {25 -- 28}, year = {2012}, language = {en} } @inproceedings{KlindtBaumProhaskaetal.2012, author = {Klindt, Marco and Baum, Daniel and Prohaska, Steffen and Hege, Hans-Christian}, title = {iCon.text - a customizable iPad app for kiosk applications in museum exhibitions}, booktitle = {EVA 2012 Berlin}, publisher = {Gesellschaft zur F{\"o}rderung angewandter Informatik e.V.}, address = {Volmerstraße 3, 12489 Berlin}, pages = {150 -- 155}, year = {2012}, language = {en} } @inproceedings{WiebelPreisVosetal.2013, author = {Wiebel, Alexander and Preis, Philipp and Vos, Frans and Hege, Hans-Christian}, title = {3D Strokes on Visible Structures in Direct Volume Rendering}, booktitle = {EuroVis - Short Papers}, editor = {Hlawitschka, Mario and Weinkauf, Tino}, publisher = {Eurographics Association}, doi = {10.2312/PE.EuroVisShort.EuroVisShort2013.091-095}, pages = {91 -- 95}, year = {2013}, language = {en} } @inproceedings{KuhnLindowGuentheretal.2013, author = {Kuhn, Alexander and Lindow, Norbert and G{\"u}nther, Tobias and Wiebel, Alexander and Theisel, Holger and Hege, Hans-Christian}, title = {Trajectory Density Projection for Vector Field Visualization}, booktitle = {EuroVis 2013, short papers. M. Hlawitschka, Tino Weinkauf (eds.)}, doi = {10.2312/PE.EuroVisShort.EuroVisShort2013.031-035}, pages = {31 -- 35}, year = {2013}, language = {en} }