English
Related papers

Related papers: Trisecting a 4-dimensional book into three chapter…

200 papers

A trisection of a smooth, closed, oriented 4-manifold is a decomposition into three 4-dimensional 1-handlebodies meeting pairwise in 3-dimensional 1-handlebodies, with triple intersection a closed surface. The fundamental groups of the…

Geometric Topology · Mathematics 2018-03-28 Aaron Abrams , David T. Gay , Robion Kirby

Boolean operations of geometric models is an essential issue in computational geometry. In this paper, we develop a simple and robust approach to perform Boolean operations on closed and open triangulated surfaces. Our method mainly has two…

Computational Geometry · Computer Science 2023-07-19 Gang Mei , John C. Tipper

We build handle decompositions of n-manifolds that encode given open book decompositions and describe handle slides that reveal new open book decompositions on the same underlying manifold, for $n \geq 3$. This recovers known stabilization…

Geometric Topology · Mathematics 2025-05-27 Chun-Sheng Hsueh

Recently Gay and Kirby described a new decomposition of smooth closed $4$-manifolds called a trisection. This paper generalises Heegaard splittings of $3$-manifolds and trisections of $4$-manifolds to all dimensions, using triangulations as…

Geometric Topology · Mathematics 2017-11-27 J. Hyam Rubinstein , Stephan Tillmann

Tightness is a generalisation of the notion of convexity: a space is tight if and only if it is "as convex as possible", given its topological constraints. For a simplicial complex, deciding tightness has a straightforward exponential time…

Computational Geometry · Computer Science 2018-10-24 Bhaskar Bagchi , Benjamin A. Burton , Basudeb Datta , Nitin Singh , Jonathan Spreer

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…

Geometric Topology · Mathematics 2007-10-11 G. Brumfiel , H. Hilden , M. T. Lozano , J. M. Montesinos--Amilibia , E. Ramirez--Losada , H. Short , D. Tejada , M. Toro

We show that there exists an algorithm that takes as input two closed, simply connected, topological 4-manifolds and decides whether or not these 4-manifolds are homeomorphic. In particular, we explain in detail how closed, simply…

Let $(M,\xi)$ be a contact 3-manifold. We present two new algorithms, the first of which converts an open book $(\Sigma,\Phi)$ supporting $(M,\xi)$ with connected binding into a contact surgery diagram. The second turns a contact surgery…

Geometric Topology · Mathematics 2019-08-29 Russell Avdek

We classify the $3$-manifolds obtained as the preimages of arcs on the plane for simplified $(2, 0)$-trisection maps, which we call vertical $3$-manifolds. Such a $3$-manifold is a connected sum of a $6$-tuple of vertical $3$-manifolds over…

Geometric Topology · Mathematics 2020-10-19 Nobutaka Asano

The purpose of the present paper is twofold: firstly to extend to non-orientable compact 4-manifolds the notion of gem-induced trisection, directly obtained from colored triangulations (or, equivalently, from colored graphs encoding them,…

Geometric Topology · Mathematics 2025-01-29 Maria Rita Casali , Paola Cristofori

We develop a technique for gluing relative trisection diagrams of $4$-manifolds with nonempty connected boundary to obtain trisection diagrams for closed $4$-manifolds. As an application, we describe a trisection of any closed $4$-manifold…

Geometric Topology · Mathematics 2020-01-10 Nickolas A. Castro , Burak Ozbagci

This survey aims to provide a guide to the literature on topological 4-manifolds. Foundational theorems on 4-manifolds are stated, especially in the topological category. Precise references are given, with indications of the strategies…

Geometric Topology · Mathematics 2024-01-03 Stefan Friedl , Matthias Nagel , Patrick Orson , Mark Powell

We study open books (or open book decompositions) of a closed oriented 3-manifold which support overtwisted contact structures. We focus on a simple closed curve along which one can perform Stallings twist, called ``twisting loop''. We show…

Geometric Topology · Mathematics 2007-05-23 Ryosuke Yamamoto

We present an algorithm to unfold any triangulated 2-manifold (in particular, any simplicial polyhedron) into a non-overlapping, connected planar layout in linear time. The manifold is cut only along its edges. The resulting layout is…

Computational Geometry · Computer Science 2007-05-23 Erik D. Demaine , David Eppstein , Jeff Erickson , George W. Hart , Joseph O'Rourke

We present a practical algorithm to test whether a 3-manifold given by a triangulation or an ideal triangulation contains a closed essential surface. This property has important theoretical and algorithmic consequences. As a testament to…

Geometric Topology · Mathematics 2025-07-01 Benjamin A. Burton , Stephan Tillmann

In an exploration paper, {\it L. Chen, Algorithms for Deforming and Contracting Simply Connected Discrete Closed Manifolds (I)}, we designed algorithms for deforming and contracting a simply connected discrete closed manifold to a discrete…

General Topology · Mathematics 2017-07-17 Li Chen

A real 3-manifold is a smooth 3-manifold together with an orientation preserving smooth involution, called a real structure. In this article we study open book decompositions on smooth real 3-manifolds that are compatible with the real…

Geometric Topology · Mathematics 2015-10-09 Ferit Ozturk , Nermin Salepci

This is a survey of known algorithms in algebraic topology with a focus on finite simplicial complexes and, in particular, simplicial manifolds. Wherever possible an elementary approach is chosen. This way the text may also serve as a…

Algebraic Topology · Mathematics 2007-05-23 Michael Joswig

3-manifolds are commonly represented as triangulations, consisting of abstract tetrahedra whose triangular faces are identified in pairs. The combinatorial sparsity of a triangulation, as measured by the treewidth of its dual graph, plays a…

Computational Geometry · Computer Science 2026-03-13 Kristóf Huszár , Clément Maria

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…