Related papers: Trisecting a 4-dimensional book into three chapter…
We study the existence of geometrically controlled branched covering maps from $\mathbb R^3$ to open $3$-manifolds or to decomposition spaces $\mathbb S^3/G$, and from $\mathbb S^3/G$ to $\mathbb S^3$.
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 paper considers an extension of origami geometry to the case of "folding" a three dimensional (3D) space along a plane. First, all possible incidence constraints between given points, lines and planes are analyzed by using the geometry…
Folding is emerging as a promising manufacturing process to transform flat materials into functional structures, offering efficiency by reducing the need for welding, gluing, and molding, while minimizing waste and enabling automation.…
In this paper, we propose an incremental algorithm for computing cylindrical algebraic decompositions. The algorithm consists of two parts: computing a complex cylindrical tree and refining this complex tree into a cylindrical tree in real…
We propose a space-efficient algorithm for hidden surface removal that combines one of the fastest previous algorithms for that problem with techniques based on bit manipulation. Such techniques had been successfully used in other settings,…
We prove that every smoothly embedded surface in a 4--manifold can be isotoped to be in bridge position with respect to a given trisection of the ambient 4--manifold; that is, after isotopy, the surface meets components of the trisection in…
We show that a transverse link in a contact structure supported by an open book decomposition can be transversely braided. We also generalize Markov's theorem on when the closures of two braids represent (transversely) isotopic links.
A high-level description of an algorithm which computes the minimum perimeter triangle enclosing a convex polygon in linear time exists in the literature. Besides that an implementation of the algorithm is given in the subsequent work.…
In this work, we present a three-part system that automatically sorts books on a shelf using the PR- 2 platform. The paper describes a methodology to sufficiently detect and recognize books using a multistep vision pipeline based on deep…
It is known by A. Loi and R. Piergallini that a closed, oriented, smooth 3-manifold is Stein fillable if and only if it has a positive open book decomposition. In the present paper we will show that for every link L in a Stein fillable…
Modern 3D printing technologies and the upcoming mass-customization paradigm call for efficient methods to produce and distribute arbitrarily-shaped 3D objects. This paper introduces an original algorithm to split a 3D model in parts that…
Let $W$ be a nonorientable $4$-dimensional handlebody without $3$- and $4$-handles. We show that $W$ admits a Lefschetz fibration over the $2$-disk, whose regular fiber is a nonorientable surface with nonempty boundary. This is an analogue…
We prove that every cusped hyperbolic 3-manifold has a finite cover admitting infinitely many geometric ideal triangulations. Furthermore, every long Dehn filling of one cusp in this cover admits infinitely many geometric ideal…
Trisecting an angle has been proved to be impossible by Euclidean Geometry, using only straight edge and compass. However, there is a method using Origami (paper folding) procedure to trisect an angle. The algebraic analysis of the same…
This paper is devoted to the construction of order reduced method of fourth order problems. A framework is presented such that a problem on a high-regularity space can be deduced in a constructive way to an equivalent problem on three…
Suppose that the 3-manifold M is given by integral surgery along a link L in S^3. In the following we construct a stable map from M to the plane, whose singular set is canonically oriented. We obtain upper bounds for the minimal numbers of…
In this paper, we describe versions of triclustering algorithms adapted for efficient calculations in distributed environments with MapReduce model or parallelisation mechanism provided by modern programming languages. OAC-family of…
For each closed oriented 3-manifold $M$ in Thurston's picture, the set of degrees of self-maps on $M$ is given.
We study a coverings of open books and virtually overtwisted contact manifolds using open book foliations. We show that open book coverings produces interesting examples such as transverse knots with depth grater than 1. We also demonstrate…