Related papers: 0-efficient triangulations of 3-manifolds
Triangles are everywhere in the virtual world. The surface of nearly every graphical object is saved as a triangular mesh on a computer. Light effects and movements of virtual objects are computed on the basis of triangulations. Besides…
We give a simple combinatoric proof of an exponential upper bound on the number of distinct 3-manifolds that can be constructed by successively identifying nearest neighbour pairs of triangles in the boundary of a simplicial 3-ball and show…
We give a fast algorithm for computing an irreducible triangulation $T^\prime$ of an oriented, connected, boundaryless, and compact surface $S$ in $E^d$ from any given triangulation $T$ of $S$. If the genus $g$ of $S$ is positive, then our…
We present ManifoldPlus, a method for robust and scalable conversion of triangle soups to watertight manifolds. While many algorithms in computer graphics require the input mesh to be a watertight manifold, in practice many meshes designed…
We classify those compact 3-manifolds with incompressible toral boundary whose fundamental groups are residually free. For example, if such a manifold $M$ is prime and orientable and the fundamental group of $M$ is non-trivial then $M \cong…
Work of Kalelkar, Schleimer, and Segerman shows that, with some exceptions, the set of essential ideal triangulations of an orientable cusped hyperbolic 3-manifold is connected via 2-3 and 3-2 moves. It is natural to ask if the subgraph…
We present the census of all non-orientable, closed, connected 3-manifolds admitting a rigid crystallization with at most 30 vertices. In order to obtain the above result, we generate, manipulate and compare, by suitable computer…
The complete sets of irreducible triangulations are known for the orientable surfaces with genus of 0, 1, or 2 and for the nonorientable surfaces with genus of 1, 2, 3, or 4. By examining these sets we determine some of the properties of…
The existence of essential closed surfaces surfaces is proven for finite coverings of 3-manifolds that are triangulated by finitely many topological ideal tetrahedra and admit a regular, negatively curved, ideal structure.
We give a simple method to find ideal points of the character variety of a 3-manifold from an ideal triangulation.
Orthogonality constrained optimization is widely used in applications from science and engineering. Due to the nonconvex orthogonality constraints, many numerical algorithms often can hardly achieve the global optimality. We aim at…
A triangulation of a surface is \emph{irreducible} if there is no edge whose contraction produces another triangulation of the surface. We prove that every irreducible triangulation of a surface with Euler genus $g\geq1$ has at most $13g-4$…
Drawing together techniques from combinatorics and computer science, we improve the census algorithm for enumerating closed minimal P^2-irreducible 3-manifold triangulations. In particular, new constraints are proven for face pairing…
Various tasks in scientific computing can be modeled as an optimization problem on the indefinite Stiefel manifold. We address this using the Riemannian approach, which basically consists of equipping the feasible set with a Riemannian…
Barnette and Edelson have shown that there are finitely many minimal triangulations of a connected compact 2-manifold M. Similar finiteness results are obtained for cellular partial triangulations that satisfy various girth inequality…
This paper gives sharp linear bounds on the genus of a normal surface in a triangulated compact, orientable 3--manifold in terms of the quadrilaterals in its cell decomposition---different bounds arise from varying hypotheses on the surface…
This is the first in a series of papers where we will derive invariants of three-manifolds and framed knots in them from the geometry of a manifold pseudotriangulation put in some way in a four-dimensional Euclidean space. Thus, the…
The spine of a trisected 4-manifold is a singular 3-dimensional set from which the trisection itself can be reconstructed. 3-manifolds embedded in the trisected 4--manifold can often be isotoped to lie almost or entirely in the spine of the…
In the given paper the algorithm describing original and universal principles of a triangulation of a smooth molecular surface: solvent excluding solvent (SES), received by primary and secondary rolling, and solvent accessible surface (SAS)…
A completely well-centered tetrahedral mesh is a triangulation of a three dimensional domain in which every tetrahedron and every triangle contains its circumcenter in its interior. Such meshes have applications in scientific computing and…