@phdthesis{Prohaska, author = {Prohaska, Steffen}, title = {Skeleton-based visualization of massive voxel objects with network-like architecture}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-14888}, abstract = {This work introduces novel internal and external memory algorithms for computing voxel skeletons of massive voxel objects with complex network-like architecture and for converting these voxel skeletons to piecewise linear geometry, that is triangle meshes and piecewise straight lines. The presented techniques help to tackle the challenge of visualizing and analyzing 3d images of increasing size and complexity, which are becoming more and more important in, for example, biological and medical research. Section 2.3.1 contributes to the theoretical foundations of thinning algorithms with a discussion of homotopic thinning in the grid cell model. The grid cell model explicitly represents a cell complex built of faces, edges, and vertices shared between voxels. A characterization of pairs of cells to be deleted is much simpler than characterizations of simple voxels were before. The grid cell model resolves topologically unclear voxel configurations at junctions and locked voxel configurations causing, for example, interior voxels in sets of non-simple voxels. A general conclusion is that the grid cell model is superior to indecomposable voxels for algorithms that need detailed control of topology. Section 2.3.2 introduces a noise-insensitive measure based on the geodesic distance along the boundary to compute two-dimensional skeletons. The measure is able to retain thin object structures if they are geometrically important while ignoring noise on the object's boundary. This combination of properties is not known of other measures. The measure is also used to guide erosion in a thinning process from the boundary towards lines centered within plate-like structures. Geodesic distance based quantities seem to be well suited to robustly identify one- and two-dimensional skeletons. Chapter 6 applies the method to visualization of bone micro-architecture. Chapter 3 describes a novel geometry generation scheme for representing voxel skeletons, which retracts voxel skeletons to piecewise linear geometry per dual cube. The generated triangle meshes and graphs provide a link to geometry processing and efficient rendering of voxel skeletons. The scheme creates non-closed surfaces with boundaries, which contain fewer triangles than a representation of voxel skeletons using closed surfaces like small cubes or iso-surfaces. A conclusion is that thinking specifically about voxel skeleton configurations instead of generic voxel configurations helps to deal with the topological implications. The geometry generation is one foundation of the applications presented in Chapter 6. Chapter 5 presents a novel external memory algorithm for distance ordered homotopic thinning. The presented method extends known algorithms for computing chamfer distance transformations and thinning to execute I/O-efficiently when input is larger than the available main memory. The applied block-wise decomposition schemes are quite simple. Yet it was necessary to carefully analyze effects of block boundaries to devise globally correct external memory variants of known algorithms. In general, doing so is superior to naive block-wise processing ignoring boundary effects. Chapter 6 applies the algorithms in a novel method based on confocal microscopy for quantitative study of micro-vascular networks in the field of microcirculation.}, language = {en} } @misc{Woelk, type = {Master Thesis}, author = {W{\"o}lk, Bertram}, title = {Generierung hybrider Gitter f{\"u}r die Str{\"o}mungssimulation auf komplexen anatomischen Geometrien}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-11588}, school = {Zuse Institute Berlin (ZIB)}, abstract = {Basierend auf einem vorhandenen Ansatz zur Einf{\"u}hrung von anisotropen Tetraedern im Randbereich eines reinen Tetraedergitters wird ein Gittergenerator f{\"u}r hybride Gitter implementiert. Das hybride Gitter besteht in Randn{\"a}he prim{\"a}r aus anisotropen Prismen und im Inneren der Geometrie aus isotropen Tetraedern. Eine erh{\"o}hte Aufl{\"o}sung im Randbereich soll zu besseren Ergebnissen von numerischen Str{\"o}mungssimulationen f{\"u}hren, f{\"u}r welche eine problemangepasste Diskretisierung des zu untersuchenden Gebietes ben{\"o}tigt wird. In dem zuvor genannten Ansatz wird eine Reihe von {\"U}bergangselementen vorgeschlagen, die an scharfen Kanten der Oberfl{\"a}che platziert werden sollen. Im Rahmen dieser Diplomarbeit wird die Idee der {\"U}bergangselemente aufgegriffen und bei hybriden Gittern eingesetzt, um auch komplexe Eingabegeometrien vergittern zu k{\"o}nnen. Der urspr{\"u}ngliche Gittergenerierungprozess wird {\"u}berarbeitet und erweitert. Eine neue Menge an {\"U}bergangselementen wird eingef{\"u}hrt, es werden gekr{\"u}mmte Extrusionsvektoren verwendet und es wird die Auswertung der medialen Oberfl{\"a}che vorgenommen, um {\"U}berschneidungen im hybriden Gitter zu vermeiden. Der Gittergenerator wird als Modul in das Visualisierungs- und Analyseprogramm Amira implementiert und die erstellten hybriden Gitter werden auf ihre Elementqualit{\"a}t und die G{\"u}te der Str{\"o}mungssimulationsergebnisse hin {\"u}berpr{\"u}ft.}, language = {de} } @misc{TycowiczAmbellanMukhopadhyayetal., author = {Tycowicz, Christoph von and Ambellan, Felix and Mukhopadhyay, Anirban and Zachow, Stefan}, title = {A Riemannian Statistical Shape Model using Differential Coordinates}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-61175}, abstract = {We propose a novel Riemannian framework for statistical analysis of shapes that is able to account for the nonlinearity in shape variation. By adopting a physical perspective, we introduce a differential representation that puts the local geometric variability into focus. We model these differential coordinates as elements of a Lie group thereby endowing our shape space with a non-Euclidian structure. A key advantage of our framework is that statistics in a manifold shape space become numerically tractable improving performance by several orders of magnitude over state-of-the-art. We show that our Riemannian model is well suited for the identification of intra-population variability as well as inter-population differences. In particular, we demonstrate the superiority of the proposed model in experiments on specificity and generalization ability. We further derive a statistical shape descriptor that outperforms the standard Euclidian approach in terms of shape-based classification of morphological disorders.}, 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{KaelbererPolthierReitebuchetal., author = {K{\"a}lberer, Felix and Polthier, Konrad and Reitebuch, Ulrich and Wardetzky, Max}, title = {Compressing Triangle Meshes using Geometric Infomation}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-8016}, number = {04-26}, abstract = {We introduce FreeLence, a lossless single-rate connectivity compression algorithm for triangle surface meshes. Based upon a geometry-driven traversal scheme we present two novel and simple concepts: free-valence connectivity encoding and entropy coding based on geometric context. Together these techniques yield significantly smaller rates for connectivity compression than current state of the art approaches - valence-based algorithms and Angle- Analyzer, with an average of \$36\\%\$ improvement over the former and an average of \$18\\%\$ over the latter on benchmark 3D models, combined with the ability to well adapt to the regularity of meshes. We also prove that our algorithm exhibits a smaller worst case entropy for a class of "'well-behaved"' triangle meshes than valence-driven connectivity encoding approaches.}, language = {en} } @misc{HildebrandtPolthier, author = {Hildebrandt, Klaus and Polthier, Konrad}, title = {Anisotropic Filtering of Non-Linear Surface Features}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-8003}, number = {04-25}, abstract = {A new method for noise removal of arbitrary surfaces meshes is presented which focuses on the preservation and sharpening of non-linear geometric features such as curved surface regions and feature lines. Our method uses a prescribed mean curvature flow (PMC) for simplicial surfaces which is based on three new contributions: 1. the definition and efficient calculation of a discrete shape operator and principal curvature properties on simplicial surfaces that is fully consistent with the well-known discrete mean curvature formula, 2. an anisotropic discrete mean curvature vector that combines the advantages of the mean curvature normal with the special anisotropic behaviour along feature lines of a surface, and 3. an anisotropic prescribed mean curvature flow which converges to surfaces with an estimated mean curvature distribution and with preserved non-linear features. Additionally, the PMC flow prevents boundary shrinkage at constrained and free boundary segments.}, language = {en} } @misc{SanderRunge, author = {Sander, Oliver and Runge, Daniel}, title = {Fast Surface Reconstruction Using a Probe Sphere}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-6181}, number = {00-50}, abstract = {We introduce a new method for reconstructing a triangular surface from an unorganized set of points in space. It is based on placing a probe sphere on the point set and rolling it around, connecting all triples of points with a triangle that the sphere comes to rest on. Therefore, the algorithm interpolates, rather than approximates, the input points. The method needs considerably less running time than previous algorithms and yields good results on point sets that are reasonably well-behaved.}, language = {en} } @misc{LangePolthier, author = {Lange, Carsten and Polthier, Konrad}, title = {Anisotropic Smoothing of Point Sets}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-8508}, number = {05-16}, abstract = {The use of point sets instead of meshes became more popular during the last years. We present a new method for anisotropic fairing of a point sampled surface using an anisotropic geometric mean curvature flow. The main advantage of our approach is that the evolution removes noise from a point set while it detects and enhances geometric features of the surface such as edges and corners. We derive a shape operator, principal curvature properties of a point set, and an anisotropic Laplacian of the surface. This anisotropic Laplacian reflects curvature properties which can be understood as the point set analogue of Taubin's curvature-tensor for polyhedral surfaces. We combine these discrete tools with techniques from geometric diffusion and image processing. Several applications demonstrate the efficiency and accuracy of our method.}, language = {en} }