Star Unfolding Convex Polyhedra via Quasigeodesic Loops

We extend the notion of star unfolding to be based on a quasigeodesic loop Q rather than on a point. This gives a new general method to unfold the surface of any convex polyhedron P to a simple (non-overlapping), planar polygon: cut along one shortest path from each vertex of P to Q, and cut all but one segment of Q.Comment: 10 pages, 7 figures. v2 improves the description of cut locus, and adds references. v3 improves two figures and their captions. New version v4 offers a completely different proof of non-overlap in the quasigeodesic loop case, and contains several other substantive improvements. This version is 23 pages long, with 15 figure

Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes

We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon. We explore basic enumeration questions in both directions: Given a polygon, how many foldings are there? Given a polytope, how many unfoldings are there to simple polygons? Throughout we give special attention to convex polygons, and to regular polygons. We show that every convex polygon folds to an infinite number of distinct polytopes, but that their number of combinatorially distinct gluings is polynomial. There are, however, simple polygons with an exponential number of distinct gluings. In the reverse direction, we show that there are polytopes with an exponential number of distinct cuttings that lead to simple unfoldings. We establish necessary conditions for a polytope to have convex unfoldings, implying, for example, that among the Platonic solids, only the tetrahedron has a convex unfolding. We provide an inventory of the polytopes that may unfold to regular polygons, showing that, for n>6, there is essentially only one class of such polytopes.Comment: 54 pages, 33 figure

Reconstructing Geometric Structures from Combinatorial and Metric Information

In this dissertation, we address three reconstruction problems. First, we address the problem of reconstructing a Delaunay triangulation from a maximal planar graph. A maximal planar graph G is Delaunay realizable if there exists a realization of G as a Delaunay triangulation on the plane. Several classes of graphs with particular graph-theoretic properties are known to be Delaunay realizable. One such class of graphs is outerplanar graph. In this dissertation, we present a new proof that an outerplanar graph is Delaunay realizable. Given a convex polyhedron P and a point s on the surface (the source), the ridge tree or cut locus is a collection of points with multiple shortest paths from s on the surface of P. If we compute the shortest paths from s to all polyhedral vertices of P and cut the surface along these paths, we obtain a planar polygon called the shortest path star (sp-star) unfolding. It is known that for any convex polyhedron and a source point, the ridge tree is contained in the sp-star unfolding polygon [8]. Given a combinatorial structure of a ridge tree, we show how to construct the ridge tree and the sp-star unfolding in which it lies. In this process, we address several problems concerning the existence of sp-star unfoldings on specified source point sets. Finally, we introduce and study a new variant of the sp-star unfolding called (geodesic) star unfolding. In this unfolding, we cut the surface of the convex polyhedron along a set of non-crossing geodesics (not-necessarily the shortest). We study its properties and address its realization problem. Finally, we consider the following problem: given a geodesic star unfolding of some convex polyhedron and a source point, how can we derive the sp-star unfolding of the same polyhedron and the source point? We introduce a new algorithmic operation and perform experiments using that operation on a large number of geodesic star unfolding polygons. Experimental data provides strong evidence that the successive applications of this operation on geodesic star unfoldings will lead us to the sp-star unfolding

Shortest Path Problems on a Polyhedral Surface

We develop algorithms to compute shortest path edge sequences, Voronoi diagrams, the Fréchet distance, and the diameter for a polyhedral surface

The Star Unfolding from a Geodesic Curve

An unfolding of a polyhedron P is obtained by `cutting' the surface of P in such a way that it can be flattened into the plane into a single polygon. For most practical and theoretic applications, it is desirable for an algorithm to produce an unfolding which is simple, that is, non-overlapping. Currently, two methods for unfolding which guarantee non-overlap for convex polyhedra are known, the source unfolding, and the star}unfolding. Both methods involve computing shortest paths from a single source point on the polyhedron's surface. In this thesis, we attempt to prove non-overlap of a variant called the geodesic star unfolding. This unfolding, much like the star unfolding, is computed by cutting shortest paths from each vertex to λ, a geodesic curve on the surface of a convex polyhedron P, and also cutting λ itself. Non-overlap of this case was conjectured by Demaine and Lubiw (2011). We are unsuccessful in completely proving non-overlap, though we present a number of partial results, and discuss some areas for future study. We first develop a new proof for non-overlap of the star unfolding from a point. The original proof of non-overlap was given by Aronov and O'Rourke (2009). This new proof uses a partitioning of the unfolding around the ridge tree. Each edge of the ridge tree serves as a base edge to a pair of congruent triangles; in this way, the whole unfolding is decomposed into these pairs which are called kites. We prove non-overlap by showing that pairwise, no two kites in the unfolding overlap each other, by a method which bounds the surface angle of the source images to either side of any path through the ridge tree. In addition to its simplicity compared to the previous proof, this new method easily generalizes to prove non-overlap for some cases of the star unfolding from geodesic curves. Specifically, we show non-overlap for two classes of geodesic curves, geodesic loops, and fully-extended S-shaped geodesics, by showing that the surface angle of the source images in those two cases are bounded. We also investigate a class of curves called fully-extended C-shaped geodesics for which the proof cannot hold directly. We show some specific cases where we are able to create a supplementary proof to show non-overlap, though non-overlap for the class as a whole remains unproven

Large bichromatic point sets admit empty monochromatic 4-gons

We consider a variation of a problem stated by Erd˝os and Szekeres in 1935 about the existence of a number fES(k) such that any set S of at least fES(k) points in general position in the plane has a subset of k points that are the vertices of a convex k-gon. In our setting the points of S are colored, and we say that a (not necessarily convex) spanned polygon is monochromatic if all its vertices have the same color. Moreover, a polygon is called empty if it does not contain any points of S in its interior. We show that any bichromatic set of n ≥ 5044 points in R2 in general position determines at least one empty, monochromatic quadrilateral (and thus linearly many).Postprint (published version

An extended MMP algorithm: wavefront and cut-locus on a convex polyhedron

In the present paper, we propose a novel generalization of the celebrated MMP algorithm in order to find the wavefront propagation and the cut-locus on a convex polyhedron with an emphasis on actual implementation for instantaneous visualization and numerical computation.Comment: To appear in International Journal of Computational Geometry & Application

Path Integrals in the Sky: Classical and Quantum Problems with Minimal Assumptions

Cosmology has, after the formulation of general relativity, been transformed from a branch of philosophy into an active field in physics. Notwithstanding the significant improvements in our understanding of our Universe, there are still many open questions on both its early and late time evolution. In this thesis, we investigate a range of problems in classical and quantum cosmology, using advanced mathematical tools, and making only minimal assumptions. In particular, we apply Picard-Lefschetz theory, catastrophe theory, infinite dimensional measure theory, and weak-value theory. To study the beginning of the Universe in quantum cosmology, we apply Picard-Lefschetz theory to the Lorentzian path integral for gravity. We analyze both the Hartle-Hawking no-boundary proposal and Vilenkin's tunneling proposal, and demonstrate that the Lorentzian path integral corresponding to the mini-superspace formulation of the two proposals is well-defined. However, when including fluctuations, we show that the path integral predicts the existence of large fluctuations. This indicates that the Universe cannot have had a smooth beginning in Euclidean de Sitter space. In response to these conclusions, the scientific community has made a series of adapted formulations of the no-boundary and tunneling proposals. We show that these new proposals suffer from similar issues. Second, we generalize the weak-value interpretation of quantum mechanics to relativistic systems. We apply this formalism to a relativistic quantum particle in a constant electric field. We analyze the evolution of the relativistic particle in both the classical and the quantum regime and evaluate the back-reaction of the Schwinger effect on the electric field in $1+1$-dimensional spacetime, using analytical methods. In addition, we develop a numerical method to evaluate both the wavefunction and the corresponding weak-values in more general electric and magnetic fields. We conclude the quantum part of this thesis with a chapter on Lorentzian path integrals. We propose a new definition of the real-time path integral in terms of Brownian motion on the Lefschetz thimble of the theory. We prove the existence of a $\sigma$-measure for the path integral of the non-relativistic free particle, the (inverted) harmonic oscillator, and the relativistic particle in a range of potentials. We also describe how this proposal extends to more general path integrals. In the classical part of this thesis, we analyze two problems in late-time cosmology. Multi-dimensional oscillatory integrals are prevalent in physics, but notoriously difficult to evaluate. We develop a new numerical method, based on multi-dimensional Picard-Lefschetz theory, for the evaluation of these integrals. The virtue of this method is that its efficiency increases when integrals become more oscillatory. The method is applied to interference patterns of lensed images near caustics described by catastrophe theory. This analysis can help us understand the lensing of astrophysical sources by plasma lenses, which is especially relevant in light of the proposed lensing mechanism for fast radio bursts. Finally, we analyze large-scale structure formation in terms of catastrophe theory. We show that the geometric structure of the three-dimensional cosmic-web is determined by both the eigenvalue and the eigenvector fields of the deformation tensor. We formulate caustic conditions, classifying caustics using properties of these fields. When applied to the Zel'dovich approximation of structure formation, the caustic conditions enable us to construct a caustic skeleton of the three-dimensional cosmic-web in terms of the initial conditions