English
Related papers

Related papers: $Z$-oriented triangulations of surfaces

200 papers

An ideal triangulation of a singular flat surface is a geodesic triangulation such that its vertex set is equal to the set of singular points of the surface. Using the fact that each pair of points in a surface has a finite number of…

Metric Geometry · Mathematics 2020-12-01 İsmail Sağlam

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…

Combinatorics · Mathematics 2019-01-30 Gennaro Amendola

The space of topological decompositions into triangulations of a surface has a natural graph structure where two triangulations share an edge if they are related by a so-called flip. This space is a sort of combinatorial Teichm\"uller space…

Geometric Topology · Mathematics 2014-11-18 Valentina Disarlo , Hugo Parlier

We show that two properly embedded compact surfaces in an orientable 4-manifold are cobordant if and only if they are $\mathbb{Z}/2$-homologous and either the 4-manifold has boundary or the surfaces have the same normal Euler number. If the…

Geometric Topology · Mathematics 2026-01-30 Simeon Hellsten

There are three complete plane geometries of constant curvature: spherical, Euclidean and hyperbolic geometry. We explain how a closed oriented surface can carry a geometry which locally looks like one of these. Focussing on the hyperbolic…

Algebraic Geometry · Mathematics 2024-06-14 Peter B. Gothen

We approach the cycle double cover conjecture by looking for a circular 2-cell embedding of cubic graphs on an arbitrary surface. It is easy to see that if such an embedding exists, we can get to it from an arbitrary starting 2-cell…

Combinatorics · Mathematics 2026-05-05 Babak Ghanbari , Robert Šámal

We consider geometric triangulations of surfaces, i.e., triangulations whose edges can be realized by disjoint locally geodesic segments. We prove that the flip graph of geometric triangulations with fixed vertices of a flat torus or a…

Computational Geometry · Computer Science 2019-12-11 Vincent Despré , Jean-Marc Schlenker , Monique Teillaud

Orthogonal surfaces are nice mathematical objects which have interesting connections to various fields, e.g., integer programming, monomial ideals and order dimension. While orthogonal surfaces in one or two dimensions are rather trivial…

Combinatorics · Mathematics 2007-05-23 Stefan Felsner , Sarah Kappes

$2$-stratifolds are a generalization of $2$-manifolds that occur as objects in applications such as in TDA. These spaces can be described by an associated bicoloured labelled graph. In previous papers we obtained a classification of…

Geometric Topology · Mathematics 2018-12-05 J. C. Gómez-Larrañaga , F. González-Acuña , Wolfgang Heil

The face pairing graph of a 3-manifold triangulation is a 4-valent graph denoting which tetrahedron faces are identified with which others. We present a series of properties that must be satisfied by the face pairing graph of a closed…

Geometric Topology · Mathematics 2010-12-21 Benjamin A. Burton

A $triangulation$ is an embedding of a graph on surfaces where every face has length three. In this article, we show the existence of contractible Hamiltonian cycle in triangulated maps of which minimum degree is four.

Combinatorics · Mathematics 2014-07-14 Dipendu Maity , Ashish Kumar Upadhyay

We study parallel surfaces and dual surfaces of cuspidal edges. We give concrete forms of principal curvature and principal direction for cuspidal edges. Moreover, we define ridge points for cuspidal edges by using those. We clarify…

Differential Geometry · Mathematics 2020-03-25 Keisuke Teramoto

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…

Combinatorics · Mathematics 2017-11-06 Basudeb Datta , Subhojoy Gupta

A family of one-vertex triangulations of 3-manifolds, layered-triangulations, is defined. Layered-triangulations are first described for handlebodies and then extended to all 3-manifolds via Heegaard splittings. A complete and detailed…

Geometric Topology · Mathematics 2007-05-23 William Jaco , J. Hyam Rubinstein

With the $[0,1,2]$-family of cyclic triangulations we introduce a rich class of vertex-transitive triangulations of surfaces. In particular, there are infinite series of cyclic $q$-equivelar triangulations of orientable and non-orientable…

Combinatorics · Mathematics 2010-01-19 Frank H. Lutz

A set of control points can determine a Bezier surface and a triangulated surface simultaneously. We prove that the triangulated surface becomes homeomorphic and ambient isotopic to the Bezier surface via subdivision. We also show that the…

Differential Geometry · Mathematics 2013-11-22 J. Li

We study the homeomorphism types of certain covers of (always orientable) surfaces, usually of infinite-type. We show that every surface with non-abelian fundamental group is covered by every noncompact surface, we identify the universal…

Geometric Topology · Mathematics 2025-08-05 Ian Biringer , Yassin Chandran , Tommaso Cremaschi , Jing Tao , Nicholas G. Vlamis , Mujie Wang , Brandis Whitfield

The complete sets of irreducible triangulations are known for the orientable surfaces with genus of 0, 1, or 2 and for the nonorientable surfaces with genus of 1, 2, 3, or 4. By examining these sets we determine some of the properties of…

Combinatorics · Mathematics 2007-05-23 Thom Sulanke

We investigate a type of distance between triangulations on finite type surfaces where one moves between triangulations by performing simultaneous flips. We consider triangulations up to homeomorphism and our main results are upper bounds…

Geometric Topology · Mathematics 2015-09-15 Valentina Disarlo , Hugo Parlier

We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triangles, to a nonoverlapping, connected planar layout. The surface is cut only along polyhedron edges. The layout is connected, but it may have…

Computational Geometry · Computer Science 2010-01-21 Erik D. Demaine , David Eppstein , Jeff Erickson , George W. Hart , Joseph O'Rourke