Related papers: The complexity of detecting taut angle structures …

The operation of crushing a normal surface has proven to be a powerful tool in computational $3$-manifold topology, with applications both to triangulation complexity and to algorithms. The main difficulty with crushing is that it can…

Continuing results from JCDCGGG 2016 and 2017, we solve several new cases of the simple foldability problem -- deciding which crease patterns can be folded flat by a sequence of (some model of) simple folds. We give new efficient algorithms…

We describe an algorithm which has enabled us to give a complete list, without repetitions, of all closed oriented irreducible 3-manifolds of complexity up to 9. More interestingly, we have actually been able to give a "name" to each such…

A method to define the complex structure and separate the conformal mode is proposed for a surface constructed by two-dimensional dynamical triangulation. Applications are made for surfaces coupled to matter fields such as $n$ scalar fields…

It is a major unsolved problem as to whether unknot recognition - that is, testing whether a given closed loop in R^3 can be untangled to form a plain circle - has a polynomial time algorithm. In practice, trivial knots (which can be…

In this paper, we explore minimal contact triangulations on contact 3-manifolds. We give many explicit examples of contact triangulations that are close to minimal ones. The main results of this article say that on any closed oriented…

We define a new combinatorial class of triangulations of closed 3-manifolds, satisfying a weak version of 0-efficiency combined with a weak version of minimality, and study them using twisted squares. As an application, we obtain strong…

Geometric embedding of graphs in a point set in the plane is a well known problem. In this paper, the complexity of a variant of this problem, where the point set is bounded by a simple polygon, is considered. Given a point set in the plane…

We consider the problem of finding a 1-planar drawing for a general graph, where a 1-planar drawing is a drawing in which each edge participates in at most one crossing. Since this problem is known to be NP-hard we investigate the…

Given an orientable ideally triangulated $3$--manifold $M$, we define a system of real valued equations and inequalities whose solutions can be used to construct projective structures on $M$. These equations represent a unifying framework…

We study the large-scale geometry of 3-manifolds with nontrivial 2-dimensional bounded cohomology, with a view to proving a weak version of the geometrization conjecture for such manifolds.

We show that an oriented elliptic 3-manifold admits a universally tight positive contact structure iff the corresponding group of deck transformations on $S^3$ preserves a standard contact structure pointwise. We also relate univerally…

In this paper we determined all of the possible self mapping degrees of the manifolds with $S^3$-geometry, which are supposed to be all 3-manifolds with finite fundamental groups. This is a part of a project to determine all possible self…

We give a bounded runtime solution to the homeomorphism problem for closed hyperbolic 3-manifolds. This is an algorithm which, given two triangulations of hyperbolic 3-manifolds by at most $t$ tetrahedra, decides if they represent the same…

It is shown that given any link-manifold, there is an algorithm to decide if the manifold contains an embedded, essential planar surface; if it does, the algorithm will construct one. If a slope on the boundary of the link-manifold is…

It is not known whether there exists a computable function bounding the number of Pachner moves needed to connect any two triangulation of a compact 3-manifold. In this paper we find an explicit bound of this kind for all Haken 3-manifolds…

A family of one-vertex triangulations of 3-manifolds, layered-triangulations, is defined. Layered-triangulations are first described for handlebodies and then extended to all 3-manifolds via Heegaard splittings. A complete and detailed…

We prove a complexity dichotomy theorem for a class of Holant problems on planar 3-regular bipartite graphs. The complexity dichotomy states that for every weighted constraint function $f$ defining the problem (the weights can even be…

Topological surgery in dimension $3$ is intrinsically connected with the classification of $3$-manifolds and with patterns of natural phenomena. In this expository paper, we present two different approaches for understanding and visualizing…

This paper focuses on the challenging problem of 3D pose estimation of a diverse spectrum of articulated objects from single depth images. A novel structured prediction approach is considered, where 3D poses are represented as skeletal…