Related papers: Decomposition and Enumeration of Triangulated Surf…
We give a brief introduction to some of the recent works on finding geometric structures on triangulated surfaces using variational principles.
It is well-known that the triangulations of the disc with $n+2$ vertices on its boundary are counted by the $n$th Catalan number $C(n)=\frac{1}{n+1}{2n \choose n}$. This paper deals with the generalisation of this problem to any arbitrary…
We compute the limit of tangents of an arbitrary surface. We obtain as a byproduct an embedded version of Jung's desingularization theorem for surface singularities with finite limits of tangents.
We associate to triangulations of infinite type surface a type of flip graph where simultaneous flips are allowed. Our main focus is on understanding exactly when two triangulations can be related by a sequence of flips. A consequence of…
In this survey article, we are interested on minimal triangulations of closed pl manifolds. We present a brief survey on the works done in last 25 years on the following: (i) Finding the minimal number of vertices required to triangulate a…
A triangulation of a punctured or pinched surface is irreducible if no edge can be shrunk without producing multiple edges or changing the topological type of the surface. The finiteness of the set of (non-isomorphic) irreducible…
We generalize the notions of flippable and simultaneously flippable edges in a triangulation of a set S of points in the plane to so-called \emph{pseudo-simultaneously flippable edges}. Such edges are related to the notion of convex…
Motivated by recent work on Delaunay triangulations of hyperbolic surfaces, we consider the minimal number of vertices of such triangulations. First, we will show that every hyperbolic surface of genus $g$ has a simplicial Delaunay…
In this paper we compute upper bounds for the number of ordinary triple points on a hypersurface in $P^3$ and give a complete classification for degree six (degree four or less is trivial, and five is elementary). But the real purpose is to…
We generalise structure tree theory, which is based on removing finitely many edges, to removing finitely many vertices. This gives a significant generalization of Tutte's tree decomposition of 2-connected graphs into 3-connected blocks.…
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…
A triangulation of a surface is \emph{irreducible} if there is no edge whose contraction produces another triangulation of the surface. We prove that every irreducible triangulation of a surface with Euler genus $g\geq1$ has at most $13g-4$…
We consider systems of simple closed curves on surfaces and their total number of intersection points, their so-called crossing number. For a fixed number of curves, we aim to minimise the crossing number. We determine the minimal crossing…
The paper is devoted to finding the colorings of the edges of the 1-skeleton of triangulations of the 2-sphere in three colors so that for each face all three of its sides have different colors. First, by the method of adding one vertex…
In general graph theory, the only relationship between vertices are expressed via the edges. When the vertices are embedded in an Euclidean space, the geometric relationships between vertices and edges can be interesting objects of study.…
In this note, we provide a generalization for the definition of a trisection of a 4-manifold with boundary. We demonstrate the utility of this more general definition by finding a trisection diagram for the Cacime Surface, and also by…
The intersection matrix of a finite simplicial complex has as each of its entries the rank of the intersection of its respective simplices. We prove that such matrix defines the triangulation of a closed connected surface up to isomorphism.
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…
We compute the number of triangulations of a convex $k$-gon each of whose sides is subdivided by $r-1$ points. We find explicit formulas and generating functions, and we determine the asymptotic behaviour of these numbers as $k$ and/or $r$…
On an orientable surface $S$, consider a collection $\Gamma$ of closed curves. The (geometric) intersection number $i_S(\Gamma)$ is the minimum number of self-intersections that a collection $\Gamma'$ can have, where $\Gamma'$ results from…