English
Related papers

Related papers: Degree-regular triangulations of surfaces

200 papers

Let $\Delta$ be a $d$-dimensional normal pseudomanifold, $d \ge 3.$ A relative lower bound for the number of edges in $\Delta$ is that $g_2$ of $\Delta$ is at least $g_2$ of the link of any vertex. When this inequality is sharp $\Delta$ has…

Geometric Topology · Mathematics 2020-02-18 Biplab Basak , Ed Swartz

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 construct a function of the edge-lengths of a triangulated surface whose variation under a rescaling of all the edges that meet at a vertex is the defect angle at that vertex. We interpret this function as a gravitational effective…

High Energy Physics - Theory · Physics 2009-11-11 Albert Ko , Martin Rocek

A digraph is 2-regular if every vertex has both indegree and outdegree two. We define an embedding of a 2-regular digraph to be a 2-cell embedding of the underlying graph in a closed surface with the added property that for every…

Combinatorics · Mathematics 2017-06-12 Dan Archdeacon , Matt DeVos , Stefan Hannie , Bojan Mohar

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

We survey basic properties and bounds for $q$-equivelar and $d$-covered triangulations of closed surfaces. Included in the survey is a list of the known sources for $q$-equivelar and $d$-covered triangulations. We identify all orientable…

Combinatorics · Mathematics 2010-01-19 Frank H. Lutz , Thom Sulanke , Anand K. Tiwari , Ashish K. Upadhyay

Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than 180 degrees. In this paper we prove that the opposite statement is also true, namely that planar…

Delaunay triangulations of a point set in the Euclidean plane are ubiquitous in a number of computational sciences, including computational geometry. Delaunay triangulations are not well defined as soon as 4 or more points are concyclic but…

Computational Geometry · Computer Science 2018-04-05 Vincent Despré , Olivier Devillers , Hugo Parlier , Jean-Marc Schlenker

A rational triangle is a triangle with sides of rational lengths. In this short note, we prove that there exists a unique pair of a rational right triangle and a rational isosceles triangle which have the same perimeter and the same area.…

Number Theory · Mathematics 2018-09-27 Yoshinosuke Hirakawa , Hideki Matsumura

We study surfaces with one constant principal curvature in Riemannian and Lorentzian three-dimensional space forms. Away from umbilic points they are characterized as one-parameter foliations by curves of constant curvature, each of these…

Differential Geometry · Mathematics 2014-02-21 Henri Anciaux

We study rotational surfaces in Euclidean 3-space whose Gauss curvature is given as a prescribed function of its Gauss map. By means of a phase plane analysis and under mild assumptions on the prescribed function, we generalize the…

Differential Geometry · Mathematics 2022-01-19 Antonio Bueno , Irene Ortiz

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

When considering regularity of surfaces, it is its geometry that is of interest. Thus, the concept of geometric regularity or geometric continuity of a specific order is a relevant concept. In this paper we discuss necessary and sufficient…

Numerical Analysis · Mathematics 2010-09-03 Bo I Johansson

Gradients of the perimeter and area of a polygon have straightforward geometric interpretations. The use of optimality conditions for constrained problems and basic ideas in triangle geometry show that polygons with prescribed area…

Metric Geometry · Mathematics 2023-09-13 Beniamin Bogosel

Given a finite point set $X$ in the plane, the degree of a pair $\{x,y\} \subset X$ is the number of empty triangles $t=conv\{x,y,z\}$, where empty means $t\cap X=\{x,y,z\}$. Define $deg X$ as the maximal degree of a pair in $X$. Our main…

Probability · Mathematics 2012-09-19 Imre Bárány , Jean-François Marckert , Matthias Reitzner

We introduce a notion of a girth-regular graph as a $k$-regular graph for which there exists a non-descending sequence $(a_1, a_2, \dots, a_k)$ (called the signature) giving, for every vertex $u$ of the graph, the number of girth cycles the…

Combinatorics · Mathematics 2019-11-05 Primož Potočnik , Janoš Vidali

In this paper we give a classification of tilings of the sphere by congruent quadrilaterals with exactly two equal edges. The tilings are the earth map tilings, $(p,q)$-earth map tilings and their flip modifications, and quadrilateral…

Combinatorics · Mathematics 2021-09-06 Ho Man Cheung , Hoi Ping Luk

Let S, T be surfaces in P3. Suppose that S intersect T is set-theoretically a smooth curve C of degree d and genus g. Suppose that S and T have no common singular points. Then if C is not a complete intersection, then deg(S), deg(T) < 2d^4.…

alg-geom · Mathematics 2008-02-03 David B. Jaffe

One of the best things about geometry is that it's cool! Geometry enables us to create incredible designs and astounding patterns. This article shows how to use a simple technique (iteration) to create designs that are both cool and…

General Mathematics · Mathematics 2021-04-14 Christopher Thron

We embark in a program of studying the problem of better approximating surfaces by triangulations(triangular meshes) by considering the approximating triangulations as finite metric spaces and the target smooth surface as their…

Graphics · Computer Science 2007-05-23 Emil Saucan