Related papers: Enumeration and random realization of triangulated…
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…
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…
Transversal structures (also known as regular edge labelings) are combinatorial structures defined over 4-connected plane triangulations with quadrangular outer-face. They have been intensively studied and used for many applications…
Stack triangulations appear as natural objects when defining an increasing family of triangulations by successive additions of vertices. We consider two different probability distributions for such objects. We represent, or "draw" these…
We describe a simple geometric transformation of triangles which leads to an efficient and effective algorithm to smooth triangle and tetrahedral meshes. Our focus lies on the convergence properties of this algorithm: we prove the…
Plane triangulations with all vertices of degree $3$ or $6$ are enumerated. A plane triangulation is said to be akempic if it has a $4$-colouring such that no two adjacent triangles have the same three colours and this colouring is not…
We enumerate complex curves on toric surfaces of any given degree and genus, having a single cusp and nodes as their singularities, and matching appropriately many point constraints. The solution is obtained via tropical enumerative…
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.
We continue the development of methods for enumerating nodal curves on smooth complex surfaces, stressing the range of validity. We illustrate the new methods in three important examples. First, for up to eight nodes, we confirm…
A typical census of 3-manifolds contains all manifolds (under various constraints) that can be triangulated with at most n tetrahedra. Al- though censuses are useful resources for mathematicians, constructing them is difficult: the best…
Through computer enumeration with the aid of topological results, we catalogue all 18 closed non-orientable P^2-irreducible 3-manifolds that can be formed from at most eight tetrahedra. In addition we give an overview as to how the 100…
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…
We consider the problem of computing a triangulation of the real projective plane P2, given a finite point set S={p1, p2,..., pn} as input. We prove that a triangulation of P2 always exists if at least six points in S are in general…
We consider tilings of quadriculated regions by dominoes and of triangulated regions by lozenges. We present an overview of results concerning tileability, enumeration and the structure of the space of tilings.
We enumerate the singular algebraic curves in a complete linear system on a smooth projective surface. The system must be suitably ample in a rather precise sense. The curves may have up to eight nodes, or a triple point of a given type and…
We introduce a notion of $k$-convexity and explore polygons in the plane that have this property. Polygons which are \mbox{$k$-convex} can be triangulated with fast yet simple algorithms. However, recognizing them in general is a 3SUM-hard…
We present two versions of a method for generating all triangulations of any punctured surface in each of these two families: (1) triangulations with inner vertices of degree at least 4 and boundary vertices of degree at least 3 and (2)…
We introduce and investigate numerically a minimal class of dynamical triangulations of two-dimensional gravity on the sphere in which only vertices of order five, six or seven are permitted. We show firstly that this restriction of the…
We prove a correspondence theorem for singular tropical surfaces in real three space, which recovers singular algebraic surfaces in an appropriate toric three-fold that tropicalize to a given singular tropical surface. Furthermore, we…
We show that there is a constant $c$ such that any 3-uniform hypergraph $\mathcal H$ with $n$ vertices and at least $cn^{5/2}$ edges contains a triangulation of the real projective plane as a subgraph. This resolves a conjecture of…