Related papers: Simplifying triangulations of S^3

One method for obtaining every closed orientable 3-manifold is as branched covering of the 3-sphere over a link. There is a classical topological result showing that the minimun possible number of sheets in the covering is three. In this…

A triangulation of a $3$-manifold can be shown to be homeomorphic to the $3$-sphere by describing a discrete Morse function on it with only two critical faces, that is, a sequence of elementary collapses from the triangulation with one…

For many fundamental problems in computational topology, such as unknot recognition and $3$-sphere recognition, the existence of a polynomial-time solution remains unknown. A major algorithmic tool behind some of the best known algorithms…

The search for universality in random triangulations of manifolds, like those featuring in (Euclidean) Dynamical Triangulations, is central to the random geometry approach to quantum gravity. In case of the 3-sphere, or any other manifold…

It is known that we can always 3-triangulate (i.e. divide into tetrahedra) convex polyhedra but not always non-convex ones. Polyhedra topologically equivalent to sphere with $p$ handles, shortly $p$-toroids, could not be convex. So, it is…

We describe a promising approach to efficiently morph spherical graphs, extending earlier approaches of Awartani and Henderson [Trans. AMS 1987] and Kobourov and Landis [JGAA 2006]. Specifically, we describe two methods to morph…

In this paper, a new triangular decomposition algorithm is proposed for ordinary differential polynomial systems, which has triple exponential computational complexity. The key idea is to eliminate one algebraic variable from a set of…

This paper uses results on the classification of minimal triangulations of 3-manifolds to produce additional results, using covering spaces. Using previous work on minimal triangulations of lens spaces, it is shown that the lens space…

Let $P\subset\mathbb{R}^{2}$ be a set of $n$ points. In this paper we show two new algorithms, one to compute the number of triangulations of $P$, and one to compute the number of pseudo-triangulations of $P$. We show that our algorithms…

It is proved that a triangulation of a polyhedron can always be transformed into any other triangulation of the polyhedron by using only elementary moves. One consequence is that an additive function (valuation) defined only on simplices…

The intersection matrix of a simplicial complex has entries equal to the rank of the intersection of its facets. In [1] the authors prove the intersection matrix is enough to determine a triangulation of a surface up to isomorphism. In this…

It is proven that the partition function of 3-dimensional simplicial gravity has an exponential upper bound with the following assumption: any three dimensional sphere $S^3$ is constructed by repeated identification of neighboring links and…

Representing complex shapes with simple primitives in high accuracy is important for a variety of applications in computer graphics and geometry processing. Existing solutions may produce suboptimal samples or are complex to implement. We…

This paper develops an algorithm that identifies and decomposes a median graph of a triangulation of a 2-dimensional (2D) oriented bordered surface and in addition restores all corresponding triangulation whenever they exist. The algorithm…

Given a set of simplifying moves on 3-manifolds, we apply them to a given 3-manifold M as long as possible. What we get is a root of M. For us, it makes sense to consider three types of moves: compressions along 2-spheres, proper discs and…

A typical census of 3-manifolds contains all manifolds (under various constraints) that can be triangulated with at most n tetrahedra. Al- though censuses are useful resources for mathematicians, constructing them is difficult: the best…

We connect k-triangulations of a convex n-gon to the theory of Schubert polynomials. We use this connection to prove that the simplicial complex with k-triangulations as facets is a vertex-decomposable triangulated sphere, and we give a new…

The space of shapes of a polyhedron with given total angles less than 2\pi at each of its n vertices has a Kaehler metric, locally isometric to complex hyperbolic space CH^{n-3}. The metric is not complete: collisions between vertices take…

We demonstrate the triangulability of compact 3-dimensional topological pseudomanifolds and study the properties of such triangulations, including the Hauptvermutung and relations by Alexander star moves and Pachner bistellar moves. We also…

We present a computational approach for unfolding 3D shapes isometrically into the plane as a single patch without overlapping triangles. This is a hard, sometimes impossible, problem, which existing methods are forced to soften by allowing…