Related papers: 0-efficient triangulations of 3-manifolds
The main ob jective of this research is to find the different types of elliptic triangulations for planar discs and spheres. We begin in Chapter 1 with the mandatory introduction. In the second chapter we define and study the notion of a…
One remarkable feature of virtual element methods (VEMs) is their great flexibility and robustness when used on almost arbitrary polytopal meshes. This very feature makes it widely used in both fitted and unfitted mesh methods. Despite…
It is still not known whether a hyperbolic 3-manifold admits an angle structure or not. We consider angle structures with area-curvature on triangulated pseudo 3-manifolds M in this article. A suficient and necessary condition for the…
In this paper we propose a new approach to incrementally initialize a manifold surface for automatic 3D reconstruction from images. More precisely we focus on the automatic initialization of a 3D mesh as close as possible to the final…
We describe theoretical backgrounds for a computer program that recognizes all closed orientable 3-manifolds up to complexity 8. The program can treat also not necessarily closed 3-manifolds of bigger complexities, but here some…
If M is a manifold with compressible boundary, we analyze essential disks in M, as well as incompressible, but not necessarily boundary incompressible, surfaces in M. We are most interested in the case where M is a handlebody or compression…
We show that a strongly irreducible and boundary-strongly irreducible surface can be isotoped to be almost normal in a triangulated 3-manifold.
We investigate the combinatorial analogues, in the context of normal surfaces, of taut and transversely measured (codimension 1) foliations of 3-manifolds. We establish that the existence of certain combinatorial structures, a priori weaker…
We study lower bounds for the number of vertices in a PL-triangulation of a given manifold $M$. While most of the previous estimates are based on the dimension and the connectivity of $M$, we show that further information can be extracted…
Dimension 4 is the first dimension in which exotic smooth manifold pairs appear -- manifolds which are topologically the same but for which there is no smooth deformation of one into the other. Whilst smooth and triangulated 4-manifolds do…
We prove that if an orientable 3-manifold $M$ admits a complete Riemannian metric whose scalar curvature is positive and has a subquadratic decay at infinity, then it decomposes as a (possibly infinite) connected sum of spherical manifolds…
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many heuristics have been proposed to partition models into few…
This paper serves as our first effort to develop a new triangular spectral element method (TSEM) on unstructured meshes, using the rectangle-triangle mapping proposed in the conference note [21]. Here, we provide some new insights into the…
This paper considers the shape formation problem within the 3D hybrid model, where a single agent with a strictly limited viewing range and the computational capacity of a deterministic finite automaton manipulates passive tiles through…
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…
A particular Riemannian metric which originally has been obtained for a well-known coordinate system in the Euclidean 3-space, is shown to specify, in fact, a manifold with boundary. There are two ways to make the manifold complete. One is…
Shape spaces are fundamental in a variety of applications including image registration, morphing, matching, interpolation, and shape optimization. In this work, we consider two-dimensional shapes represented by triangular meshes of a given…
We present an algorithm for producing Delaunay triangulations of manifolds. The algorithm can accommodate abstract manifolds that are not presented as submanifolds of Euclidean space. Given a set of sample points and an atlas on a compact…
A basic and an improved ear clipping based algorithm for triangulating simple polygons and polygons with holes are presented. In the basic version, the ear with smallest interior angle is always selected to be cut in order to create fewer…
In a variety of settings we provide a method for decomposing a 3-manifold $M$ into pieces. When the pieces have the appropriate type of hyperbolicity, then the manifold $M$ is hyperbolic and its volume is bounded below by the sum of the…