English
Related papers

Related papers: Ideally, all infinite type surfaces can be triangu…

200 papers

A triangulation of a surface is irreducible if there is no edge whose contraction produces another triangulation of the surface. In this work we propose an algorithm that constructs the set of irreducible triangulations of any surface with…

We show that all hyperbolic surfaces admit an ideal triangulation with bounded shear parameters. This upper bound depends logarithmically on the topology of the surface.

Geometric Topology · Mathematics 2025-12-11 Marie Abadie

In this paper we prove that a finite triangulation of a connected closed surface is completely determined by its intersection matrix. The \emph{intersection matrix} of a finite triangulation, $K$, is defined as $M_{K}=(dim(s_{i}\cap…

Combinatorics · Mathematics 2013-03-18 Jorge Arocha , Javier Bracho , Natalia Garcia-Colin , Isabel Hubard

In this paper we prove that the surface of the cuboctahedron can be triangulated into 8 non-obtuse triangles and 12 acute triangles. Furthermore, we show that both bounds are the best possible.

Combinatorics · Mathematics 2012-09-21 Xiao Feng , Liping Yuan

Edge-to-edge tilings of the sphere by congruent quadrilaterals are completely classified in a series of three papers. This second one applies the powerful tool of trigonometric Diophantine equations to classify the case of…

Combinatorics · Mathematics 2023-06-06 Yixi Liao , Erxiao Wang

We characterise which simplicial surfaces can be folded onto a triangle. We define a notion of folding that incorporates the non-intersection-properties of real materials. All of the surfaces foldable onto a triangle admit a…

Combinatorics · Mathematics 2019-04-30 Markus Baumeister

A simple graph is called triangular if every edge of it belongs to a triangle. We conjecture that any graphical degree sequence all terms of which are greater than or equal to 4 has a triangular realisation, and establish this conjecture…

Combinatorics · Mathematics 2023-04-03 Benjamin Egan , Yuri Nikolayevsky

We prove that every 2-dimensional polygonal complex, where each polygon is given a constant curvature metric and belongs to one of finitely many isometry classes can be triangulated using only acute simplices. There is no requirement on the…

Computational Geometry · Computer Science 2022-10-18 Florestan Brunck

The intersection matrix of a simplicial complex has entries equal to the rank of the intersection of its facets. In [1] the authors prove the intersection matrix is enough to determine a triangulation of a surface up to isomorphism. In this…

Geometric Topology · Mathematics 2021-03-01 Jorge L. Arocha , Jorge Fernández-Hidalgo

One can embed arbitrarily many disjoint, non-parallel, non-boundary parallel, incompressible surfaces in any three manifold with at least one boundary component of genus two or greater [4]. This paper proves the contrasting, but not…

Geometric Topology · Mathematics 2007-05-23 Hugh Nelson Howards

A well-known result of Walsh states that if $\mathcal T^*$ is an ideal triangulation of an atoroidal, acylindrical, irreducible, compact 3-manifold with torus boundary components, then every properly embedded, two-sided, incompressible…

Geometric Topology · Mathematics 2025-06-09 Birch Bryant

We consider whether any two triangulations of a polygon or a point set on a non-planar surface with a given metric can be transformed into each other by a sequence of edge flips. The answer is negative in general with some remarkable…

Metric Geometry · Mathematics 2010-08-02 C. Cortes , C. I. Grima , F. Hurtado , A. Marquez , F. Santos , J. Valenzuela

A taut ideal triangulation of a 3-manifold is a topological ideal triangulation with extra combinatorial structure: a choice of transverse orientation on each ideal 2-simplex, satisfying two simple conditions. The aim of this paper is to…

Geometric Topology · Mathematics 2014-11-11 Marc Lackenby

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$…

Combinatorics · Mathematics 2011-05-19 Gwenaël Joret , David R. Wood

Every noncompact surface is shown to have a (3,6)-tight triangulation, and applications are given to the generic rigidity of countable bar-joint frameworks in R^3. In particular, every noncompact surface has a (3,6)-tight triangulation that…

Combinatorics · Mathematics 2025-04-08 Stephen C. Power

We consider triangulations of closed surfaces S with a given set of vertices V; every triangulation can be branched that is enhanced to a Delta-complex. Branched triangulations are considered up to the b-transit equivalence generated by…

Geometric Topology · Mathematics 2019-04-01 Riccardo Benedetti

We introduce a notion of a bounded ideal triangulation of an infinite Riemann surface and parametrize Teichm\"uller spaces of infinite surfaces which allow bounded triangulations. We prove that our parametrization is real-analytic. Riemann…

Geometric Topology · Mathematics 2025-02-11 Casey Whitney , Dragomir Saric

We show that the triangulations of a finite point set form a flip graph that can be embedded isometrically into a hypercube, if and only if the point set has no empty convex pentagon. Point sets of this type include convex subsets of…

Computational Geometry · Computer Science 2016-08-12 David Eppstein

In this article, we construct a new simplicial complex for infinite-type surfaces, which we call the grand arc graph. We show that if the end space of a surface has at least three different self-similar equivalence classes of maximal ends,…

Geometric Topology · Mathematics 2022-01-31 Assaf Bar-Natan , Yvon Verberne

We prove that any length metric space homeomorphic to a surface may be decomposed into non-overlapping convex triangles of arbitrarily small diameter. This generalizes a previous result of Alexandrov--Zalgaller for surfaces of bounded…

Metric Geometry · Mathematics 2022-06-13 Paul Creutz , Matthew Romney