Related papers: Minimal Triangulations of Manifolds
A fixed set of vertices in the plane may have multiple planar straight-line triangulations in which the degree of each vertex is the same. As such, the degree information does not completely determine the triangulation. We show that even if…
We give a procedure to construct (quasi-)trisection diagrams for closed (pseudo-)manifolds generated by colored tensor models without restrictions on the number of simplices in the triangulation, therefore generalizing previous works in the…
This paper considers affine analogues of the isoperimetric inequality in the sense of piecewise linear topology. Given a closed polygon P embedded in R^d having n edges, we give upper and lower bounds for the minimal number of triangles…
Manifold optimization is ubiquitous in computational and applied mathematics, statistics, engineering, machine learning, physics, chemistry and etc. One of the main challenges usually is the non-convexity of the manifold constraints. By…
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…
The objects of study are triangulations of the dilated standard triangle in the plane. Motivated by work on T-curves (Geiselmann et al., 2026), the focus lies on unimodular triangulations with a fixed symmetry axis. Lower and upper bounds…
In this paper, we study certain properties of $\mathbb{Z}_2^n$-equivariant triangulations of small covers. We show that any $\mathbb{Z}_2^n$-equivariant triangulation of a small cover naturally induces a triangulation of the orbit space.…
This is the first of a series of papers studying real algebraic threefolds using the minimal model program. The main results are outlined in Part II. The present part I. contains the necessary preliminary work concerning terminal…
Algorithms that decompose a manifold into simple pieces reveal the geometric and topological structure of the manifold, showing how complicated structures are constructed from simple building blocks. This note describes a way to…
A degree-regular triangulation is one in which each vertex has identical degree. Our main result is that any such triangulation of a (possibly non-compact) surface $S$ is geometric, that is, it is combinatorially equivalent to a geodesic…
We define an invariant, which we call surface-complexity, of compact 3-manifolds by means of Dehn surfaces. The surface-complexity is a natural number measuring how much the manifold is complicated. We prove that it fulfils interesting…
This paper considers two well-studied problems \textsc{Minimum Fill-In} (\textsc{Min Fill-In}) and \textsc{Treewidth}. Since both problems are \textsf{NP}-hard, various reduction rules simplifying an input graph have been intensively…
Let $M$ be a closed triangulable manifold, and let $\Delta$ be a triangulation of $M$. What is the smallest number of vertices that $\Delta$ can have? How big or small can the number of edges of $\Delta$ be as a function of the number of…
The widely studied edge modification problems ask how to minimally alter a graph to satisfy certain structural properties. In this paper, we introduce and study a new edge modification problem centered around transforming a given graph into…
The degree of a map between orientable manifolds is a fundamental concept in topology, offering deep insights into the structure of the manifolds and the nature of the corresponding maps. This concept has been extensively studied,…
There are many fundamental algorithmic problems on triangulated 3-manifolds whose complexities are unknown. Here we study the problem of finding a taut angle structure on a 3-manifold triangulation, whose existence has implications for both…
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…
Motivated by fixed-parameter tractable (FPT) problems in computational topology, we consider the treewidth of a compact, connected 3-manifold $M$ defined by \[ \operatorname{tw}(M) =…
We study partitions on three dimensional manifolds which minimize the total geodesic perimeter. We propose a relaxed framework based on a $\Gamma$-convergence result and we show some numerical results. We compare our results to those…
We consider compact connected minimal surfaces, with a pair of boundary curves (not necessarily convex) in distinct planes, that have least-area amongst all orientable surfaces with the same boundary. When the planes containing these two…