25 research outputs found
Generalized Branching in Circle Packing
Circle packings are configurations of circle with prescribed patterns of tangency. They relate to a surprisingly diverse array of topics. Connections to Riemann surfaces, Apollonian packings, random walks, Brownian motion, and many other topics have been discovered. Of these none has garnered more interest than circle packings\u27 relationship to analytical functions. With a high degree of faithfulness, maps between circle packings exhibit essentially the same geometric properties as seen in classical analytical functions. With this as motivation, an entire theory of discrete analytic function theory has been developed. However limitations in this theory due to the discreteness of circle packings are shown to be unavoidable. This thesis explores methods to introduce continuous parameters for the purpose of overcoming these difficulties. Our topics include, packings with deep overlaps, fractional branching, and shift-points. Using the software package CirclePack, examples of some previously non-realizable discrete functions in circle packing are shown to computational exist using these techniques. Some necessary theory is developed including a generalization for overlapping packings and some results for expressing singularities associated with faces
Geometry of Matroids and Hyperplane Arrangements
There is a trinity relationship between hyperplane arrangements, matroids and
convex polytopes. We expand and combinatorialize it as settling the complexity
issue expected by Mnev's universality theorem. Based on this theory, we show
that for n less than or equal to 9 every matroid tiling in the hypersimplex
Delta(3,n) associated to a weighted stable hyperplane arrangement extends to a
matroid subdivision of Delta(3,n) and that the bound 9 for n is sharp. As a
straightforward application, we completely answer Alexeev's algebro-geometric
question.Comment: 46 pages, 24 figures; v3: minor improvement
Bers’ simultaneous uniformization and the intersection of Poincaré holonomy varieties
We consider the space of ordered pairs of distinct ℂP¹ -structures on Riemann surfaces (of any orientations) which have identical holonomy, so that the quasi-Fuchsian space is identified with a connected component of this space. This space holomorphically maps to the product of the Teichmüller spaces minus its diagonal. In this paper, we prove that this mapping is a complete local branched covering map. As a corollary, we reprove Bers’ simultaneous uniformization theorem without any quasi-conformal deformation theory. Our main theorem is that the intersection of arbitrary two Poincaré holonomy varieties (SL₂ ℂ-opers) is a non-empty discrete set, which is closely related to the mapping.The version of record of this article, first published in Geometric and Functional Analysis, is available online at Publisher’s website: https://doi.org/10.1007/s00039-023-00653-
LIPIcs, Volume 258, SoCG 2023, Complete Volume
LIPIcs, Volume 258, SoCG 2023, Complete Volum
Notes in Pure Mathematics & Mathematical Structures in Physics
These Notes deal with various areas of mathematics, and seek reciprocal
combinations, explore mutual relations, ranging from abstract objects to
problems in physics.Comment: Small improvements and addition
Generative Mesh Modeling
Generative Modeling is an alternative approach for the description of three-dimensional shape. The basic idea is to represent a model not as usual by an agglomeration of geometric primitives (triangles, point clouds, NURBS patches), but by functions. The paradigm change from objects to operations allows for a procedural representation of procedural shapes, such as most man-made objects. Instead of storing only the result of a 3D construction, the construction process itself is stored in a model file. The generative approach opens truly new perspectives in many ways, among others also for 3D knowledge management. It permits for instance to resort to a repository of already solved modeling problems, in order to re-use this knowledge also in different, slightly varied situations. The construction knowledge can be collected in digital libraries containing domain-specific parametric modeling tools. A concrete realization of this approach is a new general description language for 3D models, the "Generative Modeling Language" GML. As a Turing-complete "shape programming language" it is a basis of existing, primitv based 3D model formats. Together with its Runtime engine the GML permits - to store highly complex 3D models in a compact form, - to evaluate the description within fractions of a second, - to adaptively tesselate and to interactively display the model, - and even to change the models high-level parameters at runtime.Die generative Modellierung ist ein alternativer Ansatz zur Beschreibung von dreidimensionaler Form. Zugrunde liegt die Idee, ein Modell nicht wie üblich durch eine Ansammlung geometrischer Primitive (Dreiecke, Punkte, NURBS-Patches) zu beschreiben, sondern durch Funktionen. Der Paradigmenwechsel von Objekten zu Geometrie-erzeugenden Operationen ermöglicht es, prozedurale Modelle auch prozedural zu repräsentieren. Statt das Resultat eines 3D-Konstruktionsprozesses zu speichern, kann so der Konstruktionsprozess selber repräsentiert werden. Der generative Ansatz eröffnet unter anderem gänzlich neue Perspektiven für das Wissensmanagement im 3D-Bereich. Er ermöglicht etwa, auf einen Fundus bereits gelöster Konstruktions-Aufgaben zurückzugreifen, um sie in ähnlichen, aber leicht variierten Situationen wiederverwenden zu können. Das Konstruktions-Wissen kann dazu in Form von Bibliotheken parametrisierter, Domänen-spezifischer Modellier-Werkzeuge gesammelt werden. Konkret wird dazu eine neue allgemeine Modell-Beschreibungs-Sprache vorgeschlagen, die "Generative Modeling Language" GML. Als Turing-mächtige "Programmiersprache für Form" stellt sie eine echte Verallgemeinerung existierender Primitiv-basierter 3D-Modellformate dar. Zusammen mit ihrer Runtime-Engine erlaubt die GML, - hochkomplexe 3D-Objekte extrem kompakt zu beschreiben, - die Beschreibung innerhalb von Sekundenbruchteilen auszuwerten, - das Modell adaptiv darzustellen und interaktiv zu betrachten, - und die Modell-Parameter interaktiv zu verändern