In der Archäologie ist das Zeichnen von Fundobjekten ein zeitaufwändiger und daher kostenintensiver Prozess. Die Abbildungen sind wegen fehlender Standards sowie den unterschiedlichen persönlichen Stilen und Fähigkeiten der Zeichner subjektiv und stark inhomogen. Es gibt deswegen erste Ansätze, mithilfe von 3D-Scannern virtuelle Modelle zu erzeugen, von denen dann objektive, standardisierte Abbildungen extrahiert werden sollen. Von den zahlreichen Verfahren aus dem Bereich des Non-Photorealistic Rendering (NPR) kommen dafür insbesondere solche in Betracht, die Verzierungen und Oberflächeneigenschaften betonen. Auf Interaktion soll dabei nach Möglichkeit verzichtet werden.

Diese Arbeit beschreibt und untersucht einige der bild- verarbeitenden und statistisch-mathematischen Teilprozesse, die insgesamt einmal zur besseren Diagnose degenerativer Hirnerkrankungen, wie z.B. Morbus Alzheimer, beitragen können. Sie beschäftigt sich mit dem Schritt der Segmentation der Hirnoberfläche in Kronen- und Fundusregionen aus einer bereits vorliegenden Triangulierung derselben.

We numerically investigate crystalline order on negative Gaussian curvature capillary bridges. In agreement with the experimental results in [W. Irvine et al., Nature, Pleats in crystals on curved surfaces, 2010, 468, 947] we observe for decreasing integrated Gaussian curvature, a sequence of transitions, from no defects to isolated dislocations, pleats, scars and isolated sevenfold disclinations. We especially focus on the dependency of topological charge on the integrated Gaussian curvature, for which we observe, again in agreement with the experimental results, no net disclination for an integrated curvature down to −10, and an approximately linear behavior from there on until the disclinations match the integrated curvature of −12. In contrast to previous studies in which ground states for each geometry are searched for, we here show that the experimental results, which are likely to be in a metastable state, can be best resembled by mimicking the experimental settings and continuously changing the geometry. The obtained configurations are only low energy local minima. The results are computed using a phase field crystal approach on catenoid-like surfaces and are highly sensitive to the initialization.

We numerically investigate crystalline order on negative Gaussian curvature capillary bridges. In agreement with the experimental results in [W. Irvine et al., Nature, Pleats in crystals on curved surfaces, 2010, 468, 947] we observe for decreasing integrated Gaussian curvature, a sequence of transitions, from no defects to isolated dislocations, pleats, scars and isolated sevenfold disclinations. We especially focus on the dependency of topological charge on the integrated Gaussian curvature, for which we observe, again in agreement with the experimental results, no net disclination for an integrated curvature down to −10, and an approximately linear behavior from there on until the disclinations match the integrated curvature of −12. In contrast to previous studies in which ground states for each geometry are searched for, we here show that the experimental results, which are likely to be in a metastable state, can be best resembled by mimicking the experimental settings and continuously changing the geometry. The obtained configurations are only low energy local minima. The results are computed using a phase field crystal approach on catenoid-like surfaces and are highly sensitive to the initialization.

In der Archäologie ist das Zeichnen von Fundobjekten ein zeitaufwändiger und daher kostenintensiver Prozess. Die Abbildungen sind wegen fehlender Standards sowie den unterschiedlichen persönlichen Stilen und Fähigkeiten der Zeichner subjektiv und stark inhomogen. Es gibt deswegen erste Ansätze, mithilfe von 3D-Scannern virtuelle Modelle zu erzeugen, von denen dann objektive, standardisierte Abbildungen extrahiert werden sollen. Von den zahlreichen Verfahren aus dem Bereich des Non-Photorealistic Rendering (NPR) kommen dafür insbesondere solche in Betracht, die Verzierungen und Oberflächeneigenschaften betonen. Auf Interaktion soll dabei nach Möglichkeit verzichtet werden.

Ziel der Diplomarbeit ist es, eine Dispersion aus Monomer und Silika-Partikeln auf ein festes Substrat aufzutragen, die so erhaltenen Versuchsträger mit dem Monomer/Partikel-Film (Modell Monomer/Partikel/festes Substrat) anschließend mit dem Rasterkraftmikroskop abzubilden und anschließend hinsichtlich der Oberflächenkrümmung und dem Kontaktwinkel zu untersuchen. Durch die Kontaktwinkelmessung am Dreiphasenpunkt soll eine erste Charakterisierung der kapillaren Oberfläche erfolgen, die jedoch nur ein Teilschritt bis zur vollständigen Optimierung von durch partikel-assistierte Benetzung hergestellte poröse Membranen ist.

This thesis is twofold. In the first part, a proof of the interpolation inequality along geodesics in p-Wasserstein spaces is given and a new curvature condition on abstract metric measure spaces is defined. In the second part of the thesis a proof of the identification of the q-heat equation with the gradient flow of the Renyi (3-p)-Renyi entropy functional in the p-Wasserstein space is given. For that, a further study of the q-heat flow is presented including a condition for its mass preservation.

A theoretical explanation of the existence of lipid rafts in cell membranes remains a topic of lively debate. Large, micrometer sized rafts are readily observed in artificial membranes and can be explained using thermodynamic models for phase separation and coarsening. In live cells such domains are not observed and various models are proposed to describe why the systems do not coarsen. We review these attempts critically and show within a phase field approach that membrane bound proteins have the potential to explain the different behaviour observed in vitro and in vivo. Large scale simulations are performed to compute scaling laws and size distribution functions under the influence of membrane bound proteins and to observe a significant slow down of the domain coarsening at longer times and a breakdown of the self-similarity of the size-distribution function. / Dieser Beitrag ist mit Zustimmung des Rechteinhabers aufgrund einer (DFG-geförderten) Allianz- bzw. Nationallizenz frei zugänglich.

The interaction between the study of geometric and analytic aspects of Riemannian manifolds and that of graphs is a very amazing subject. The study of synthetic curvature notions on graphs adds new contributions to this topic. In this thesis, we mainly study two kinds of synthetic curvature notions: the Ollivier-Ricci cuvature on locally finite graphs and the combinatorial curvature on infinite semiplanar graphs. In the first part, we study the Ollivier-Ricci curvature. As known in Riemannian geometry, a lower Ricci curvature bound prevents geodesics from diverging too fast on average. We translate this Riemannian idea into a combinatorial setting using the Olliver-Ricci curvature notion. Note that on a graph, the analogue of geodesics starting in different directions, but eventually approaching each other again, would be a triangle. We derive lower and upper Ollivier-Ricci curvature bounds on graphs in terms of number of triangles, which is sharp for instance for complete graphs. We then describe the relation between Ollivier-Ricci curvature and the local clustering coefficient, which is an important concept in network analysis introduced by Watts-Strogatz. Furthermore, positive lower boundedness of Ollivier-Ricci curvature for neighboring vertices imply the existence of at least one triangle. It turns out that the existence of triangles can also improve Lin-Yau\'s curvature dimension inequality on graphs and then produce an implication from Ollivier-Ricci curvature lower boundedness to the curvature dimension inequality. The existence of triangles prevents a graph from being bipartite. A finite graph is bipartite if and only if its largest eigenvalue equals 2. Therefore it is natural that Ollivier-Ricci curvature is closely related to the largest eigenvalue estimates. We combine Ollivier-Ricci curvature notion with the neighborhood graph method developed by Bauer-Jost to study the spectrum estimates of a finite graph. We can always obtain nontrivial estimates on a non-bipartite graph even if its curvature is nonpositive. This answers one of Ollivier\'s open problem in the finite graph setting. In the second part of this thesis, we study systematically infinite semiplanar graphs with nonnegative combinatorial curvature. Unlike the previous Gauss-Bonnet formula approach, we explore an Alexandrov approach based on the observation that the nonnegative combinatorial curvature on a semiplanar graph is equivalent to nonnegative Alexandrov curvature on the surface obtained by replacing each face by a regular polygon of side length one with the same facial degree and gluing the polygons along common edges. Applying Cheeger-Gromoll splitting theorem on the surface, we give a metric classification of infinite semiplanar graphs with nonnegative curvature. We also construct the graphs embedded into the projective plane minus one point. Those constructions answer a question proposed by Chen. We further prove the volume doubling property and Poincare inequality which make the running of Nash-Moser iteration possible. We in particular explore the volume growth behavior on Archimedean tilings on a plane and prove that they satisfy a weak version of relative volume comparison with constant 1. With the above two basic inequalities in hand, we study the geometric function theory of infinite semiplanar graphs with nonnegative curvature. We obtain the Liouville type theorem for positive harmonic functions, the parabolicity. We also prove a dimension estimate for polynomial growth harmonic functions, which is an extension of the solution of Colding-Minicozzi of a conjecture of Yau in Riemannian geometry.

The interaction between the study of geometric and analytic aspects of Riemannian manifolds and that of graphs is a very amazing subject. The study of synthetic curvature notions on graphs adds new contributions to this topic. In this thesis, we mainly study two kinds of synthetic curvature notions: the Ollivier-Ricci cuvature on locally finite graphs and the combinatorial curvature on infinite semiplanar graphs. In the first part, we study the Ollivier-Ricci curvature. As known in Riemannian geometry, a lower Ricci curvature bound prevents geodesics from diverging too fast on average. We translate this Riemannian idea into a combinatorial setting using the Olliver-Ricci curvature notion. Note that on a graph, the analogue of geodesics starting in different directions, but eventually approaching each other again, would be a triangle. We derive lower and upper Ollivier-Ricci curvature bounds on graphs in terms of number of triangles, which is sharp for instance for complete graphs. We then describe the relation between Ollivier-Ricci curvature and the local clustering coefficient, which is an important concept in network analysis introduced by Watts-Strogatz. Furthermore, positive lower boundedness of Ollivier-Ricci curvature for neighboring vertices imply the existence of at least one triangle. It turns out that the existence of triangles can also improve Lin-Yau\''s curvature dimension inequality on graphs and then produce an implication from Ollivier-Ricci curvature lower boundedness to the curvature dimension inequality. The existence of triangles prevents a graph from being bipartite. A finite graph is bipartite if and only if its largest eigenvalue equals 2. Therefore it is natural that Ollivier-Ricci curvature is closely related to the largest eigenvalue estimates. We combine Ollivier-Ricci curvature notion with the neighborhood graph method developed by Bauer-Jost to study the spectrum estimates of a finite graph. We can always obtain nontrivial estimates on a non-bipartite graph even if its curvature is nonpositive. This answers one of Ollivier\''s open problem in the finite graph setting. In the second part of this thesis, we study systematically infinite semiplanar graphs with nonnegative combinatorial curvature. Unlike the previous Gauss-Bonnet formula approach, we explore an Alexandrov approach based on the observation that the nonnegative combinatorial curvature on a semiplanar graph is equivalent to nonnegative Alexandrov curvature on the surface obtained by replacing each face by a regular polygon of side length one with the same facial degree and gluing the polygons along common edges. Applying Cheeger-Gromoll splitting theorem on the surface, we give a metric classification of infinite semiplanar graphs with nonnegative curvature. We also construct the graphs embedded into the projective plane minus one point. Those constructions answer a question proposed by Chen. We further prove the volume doubling property and Poincare inequality which make the running of Nash-Moser iteration possible. We in particular explore the volume growth behavior on Archimedean tilings on a plane and prove that they satisfy a weak version of relative volume comparison with constant 1. With the above two basic inequalities in hand, we study the geometric function theory of infinite semiplanar graphs with nonnegative curvature. We obtain the Liouville type theorem for positive harmonic functions, the parabolicity. We also prove a dimension estimate for polynomial growth harmonic functions, which is an extension of the solution of Colding-Minicozzi of a conjecture of Yau in Riemannian geometry.