Related papers: Computing trisections of 4-manifolds

We describe some theoretical results on triangulations of surfaces and we develop a theory on roots, decompositions and genus-surfaces. We apply this theory to describe an algorithm to list all triangulations of closed surfaces with at most…

The shadow-complexity is an invariant of closed $4$-manifolds defined by using $2$-dimensional polyhedra called Turaev's shadows, which, roughly speaking, measures how complicated a $2$-skeleton of the $4$-manifold is. In this paper, we…

We describe an efficient algorithm to compute a pseudotriangulation of a finite planar family of pairwise disjoint convex bodies presented by its chirotope. The design of the algorithm relies on a deepening of the theory of visibility…

Closed (and simply-connected) manifolds whose dimensions are greater than 4 are classified via sophisticated algebraic and abstract theory such as surgery theory and homotopy theory. It is difficult to handle 3 or 4-dimensional closed…

A clustering algorithm partitions a set of data points into smaller sets (clusters) such that each subset is more tightly packed than the whole. Many approaches to clustering translate the vector data into a graph with edges reflecting a…

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…

Let $X$ be a connected compact 3-manifold with non-empty boundary. Consider the boundary $M$ of $X\times D^2$. $M$ is a 4-dimensional closed manifold and has the same fundamental group as $X$. Various examples of $X$ are known for which a…

We show the existence of a $4$-manifold with boundary that admits two non-diffeomorphic minimal genus relative trisections of the same $(g,k;p,b)$-type. To prove this, we introduce a simple operation that produces a trisection diagram of a…

We introduce the concept of a bridge trisection of a neatly embedded surface in a compact four-manifold, generalizing previous work with Alexander Zupan in the setting of closed surfaces in closed four-manifolds. Our main result states that…

Weinstein trisection is a trisection of a symplectic 4-manifold whose 1-handlebodies are the Weinstein domain for the symplectic structure induced from an ambient manifold. Lambert-Cole, Meier, and Starkston showed that every closed…

It is important to have fast and effective methods for simplifying 3-manifold triangulations without losing any topological information. In theory this is difficult: we might need to make a triangulation super-exponentially more complex…

We construct invariants of four-dimensional piecewise-linear manifolds, represented as simplicial complexes, with respect to rebuildings that transform a cluster of three 4-simplices having a common two-dimensional face in a different…

The spaces of triangulations of a given manifold have been widely studied. The celebrated theorem of Pachner~\cite{Pachner} says that any two triangulations of a given manifold can be connected by a sequence of bistellar moves, or Pachner…

Products of simplices, called simplotopes, and their triangulations arise naturally in algorithmic applications in game theory and optimization. We develop techniques to derive lower bounds for the size of simplicial covers and…

A notion of dual curve for pseudoholomorphic curves in 4--manifolds turns out to be possible only if the notion of almost complex structure structure is slightly generalized. The resulting structure is as easy (perhaps easier) to work with,…

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…

A fast algorithm for counting intersections of two normal curves on a triangulated surface is proposed. It yields a convenient way for treating mapping class groups of punctured surfaces by presenting mapping classes by matrices, and the…

This work is motivated by two problems: 1) The approach of manifolds and spaces by triangulations. 2) The complexity growth in sequences of polyhedra. Considering both problems as related, new criteria and methods for approximating smooth…

This paper is devoted to presenting a new approach to determine the intersection of two quadrics based on the detailed analysis of its projection in the plane (the so called cutcurve) allowing to perform the corresponding lifting correctly.…

A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices are among the vertices of the polytope. Triangulations are dissections that have the additional property that the set of all its simplices…