English
Related papers

Related papers: Decomposition and Enumeration of Triangulated Surf…

200 papers

A tree decomposition of a graph facilitates computations by grouping vertices into bags that are interconnected in an acyclic structure, hence their importance in a plethora of problems such as query evaluation over databases and inference…

Data Structures and Algorithms · Computer Science 2018-10-09 Noam Ravid , Dori Medini , Benny Kimelfeld

In this thesis, we use normal surface theory to understand certain properties of minimal triangulations of compact orientable 3-manifolds. We describe the collapsing process of normal 2-spheres and disks. Using some geometrical…

Geometric Topology · Mathematics 2009-09-29 Alexander Barchechat

A branched affine structure on a compact topological surface with marked points is a complex affine structure outside the marked points. We give a proof of an unpublished foundational theorem of Veech, stating that any branched affine…

Geometric Topology · Mathematics 2019-12-04 Guillaume Tahar

We show that if a closed $C^1$-smooth surface in a Riemannian manifold has bounded Kolasinski--Menger energy, then it can be triangulated with triangles whose number is bounded by the energy and the area. Each of the triangles is an image…

Differential Geometry · Mathematics 2021-07-20 Maciej Borodzik , Monika Szczepanowska

Triangulated surfaces are compact Riemann surfaces equipped with a conformal triangulation by equilateral triangles. In 2004, Brooks and Makover asked how triangulated surfaces are distributed in the moduli space of Riemann surfaces as the…

Complex Variables · Mathematics 2023-09-27 Sahana Vasudevan

Let $P$ be a set of $n$ points in general position on the plane. A set of closed convex polygons with vertices in $P$, and with pairwise disjoint interiors is called a convex decomposition of $P$ if their union is the convex hull of $P$,…

Combinatorics · Mathematics 2019-09-16 Toshinori Sakai , Jorge Urrutia

We develop a theory of confluence of graphs. We describe an algorithm for proving that a given system of reduction rules for abstract graphs and graphs in surfaces is locally confluent. We apply this algorithm to show that each simple Lie…

Quantum Algebra · Mathematics 2014-10-01 Adam S. Sikora , Bruce W. Westbury

Normal surface theory, a tool to represent surfaces in a triangulated 3-manifold combinatorially, is ubiquitous in computational 3-manifold theory. In this paper, we investigate a relaxed notion of normal surfaces where we remove the…

Geometric Topology · Mathematics 2016-05-04 Benjamin A. Burton , Éric Colin de Verdière , Arnaud de Mesmay

This paper has two aims. The former is to give an introduction to our earlier work on the Hodge theory of algebraic maps and more generally to some of the main themes of the theory of perverse sheaves and to some of its geometric…

Algebraic Geometry · Mathematics 2007-05-23 Mark Andrea A. de Cataldo , Luca Migliorini

We explicitly construct small triangulations for a number of well-known 3-dimensional manifolds and give a brief outline of some aspects of the underlying theory of 3-manifolds and its historical development.

Geometric Topology · Mathematics 2007-05-23 Frank H. Lutz

In 1973, Brown, Erd\H{o}s and S\'os proved that if $\mathcal{H}$ is a 3-uniform hypergraph on $n$ vertices which contains no triangulation of the sphere, then $\mathcal{H}$ has at most $O(n^{5/2})$ edges, and this bound is the best possible…

Combinatorics · Mathematics 2020-10-15 Andrey Kupavskii , Alexandr Polyanskii , István Tomon , Dmitriy Zakharov

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

We study the maximal number of triangulations that a planar set of $n$ points can have, and show that it is at most $30^n$. This new bound is achieved by a careful optimization of the charging scheme of Sharir and Welzl (2006), which has…

Discrete Mathematics · Computer Science 2010-01-03 Micha Sharir , Adam Sheffer

In this survey on combinatorial properties of triangulated manifolds we discuss various lower bounds on the number of vertices of simplicial and combinatorial manifolds. Moreover, we give a list of all known examples of vertex-minimal…

Combinatorics · Mathematics 2007-05-23 Frank H. Lutz

As another application of the degeneration methods of [V3], we count the number of irreducible degree $d$ geometric genus $g$ plane curves, with fixed multiple points on a conic $E$, not containing $E$, through an appropriate number of…

alg-geom · Mathematics 2008-02-03 Ravi Vakil

Given a sequence of properly embedded minimal surfaces in a $3$-manifold with local bounds on area and genus, we prove subsequential convergence, smooth away from a discrete set, to a smooth embedded limit surface, possibly with…

Differential Geometry · Mathematics 2024-01-26 Brian White

Let X be a closed oriented Riemann surface of genus > 1 of constant negative curvature -1. A surface containing a disk of maximal radius is an optimal surface. This paper gives exact formulae for the number of optimal surfaces of genus > 3…

Geometric Topology · Mathematics 2009-04-14 Alina Vdovina

Let Y be a surface with only finitely many singularities all of which are cusps. A set of cusps on Y is called three-divisible, if there is a cyclic global triple cover of Y branched precisely over these cusps. The aim of this note is to…

Algebraic Geometry · Mathematics 2012-09-25 Wolf P. Barth , Slawomir Rams

Square-tiled surfaces can be classified by their number of squares and their cylinder diagrams (also called realizable separatrix diagrams). For the case of $n$ squares and two cone points with angle $4 \pi$ each, we set up and parametrize…

Geometric Topology · Mathematics 2018-10-23 Sunrose T. Shrestha

We study the following family of problems: Given a set of $n$ points in convex position, what is the maximum number triangles one can create having these points as vertices while avoiding certain sets of forbidden configurations. As…

‹ Prev 1 4 5 6 7 8 10 Next ›