Related papers: Determining triangulations and quadrangulations by…

For both triangulations of point sets and simple polygons, it is known that determining the flip distance between two triangulations is an NP-hard problem. To gain more insight into flips of triangulations and to characterize "where edges…

Flips in triangulations have received a lot of attention over the past decades. However, the problem of tracking where particular edges go during the flipping process has not been addressed. We examine this question by attaching unique…

Let $P$ be a collection of $n$ points moving along pseudo-algebraic trajectories in the plane. One of the hardest open problems in combinatorial and computational geometry is to obtain a nearly quadratic upper bound, or at least a subcubic…

A path decomposition of a graph $G$ is a collection of edge-disjoint paths of $G$ that covers the edge set of $G$. Gallai (1968) conjectured that every connected graph on $n$ vertices admits a path decomposition of cardinality at most…

In this paper we derive an estimate on the number of local maxima of the free boundary of some variational inequalities with pointwise gradient constraints. This also gives an estimate on the number of connected components of the free…

We show that a vertex in the reduced crystal is i-external for a residue i if the defect is less than the absolute value of the i-component of the hub. We demonstrate the existence of a bound on the degree after which all vertices of a…

A simple graph is triangular if every edge is contained in a triangle. A sequence of integers is graphical if it is the degree sequence of a simple graph. Egan and Nikolayevsky recently conjectured that every graphical sequence whose terms…

In this paper we show that the number of distinct distances determined by a set of $n$ points on a constant-degree two-dimensional algebraic variety $V$ (i.e., a surface) in $\mathbb R^3$ is at least $\Omega\left(n^{7/9}/{\rm polylog}…

We investigate the problem of determining if a given graph corresponds to the dual of a triangulation of a simple polygon. This is a graph recognition problem, where in our particular case we wish to recognize a graph which corresponds to…

Assuming a lower bound on the Ricci curvature of a complete Riemannian manifold, for $p< 1/2$ we show the existence of bounds on the local $L^p$ norm of the Ricci curvature that depend only on the dimension and which improve with volume…

We consider quadrangulations with a boundary and derive explicit expressions for the generating functions of these maps with either a marked vertex at a prescribed distance from the boundary, or two boundary vertices at a prescribed mutual…

We establish a curvature estimate for classical minimal surfaces with total boundary curvature less than 4\pi. The main application is a bound on the genus of these surfaces depending solely on the geometry of the boundary curve. We also…

We prove that, for sufficiently large $n$, every graph of order $n$ with minimum degree at least $0.852n$ has a fractional edge-decomposition into triangles. We do this by refining a method used by Dross to establish a bound of $0.9n$. By a…

We prove that any triangulation of a surface different from the sphere and the projective plane admits an orientation without sinks such that every vertex has outdegree divisible by three. This confirms a conjecture of Bar\'at and Thomassen…

We consider the combinatorial question of how many convex polygons can be made by using the edges taken from a fixed triangulation of n vertices. For general triangulations, there can be exponentially many: we show a construction that has…

A directed diameter of a directed graph is the maximum possible distance between a pair of vertices, where paths must respect edge orientations, while undirected diameter is the diameter of the undirected graph obtained by symmetrizing the…

We investigate criteria for circle packing(CP) types of disk triangulation graphs embedded into simply connected domains in $ \mathbb{C}$. In particular, by studying combinatorial curvature and the combinatorial Gauss-Bonnet theorem…

A planar point set is in convex position precisely when it has a convex polygonization, that is, a polygonization with maximum interior angle measure at most \pi. We can thus talk about the convexity of a set of points in terms of the…

We provide a general contractibility criterion for subsets of Riemannian metrics on the disc. For instance, this result applies to the space of metrics that have positive Gauss curvature and make the boundary circle convex (or geodesic).…

A combinatorial tiling of the sphere is naturally given by an embedded graph. We study the case that each tile has exactly five edges, with the ultimate goal of classifying combinatorial tilings of the sphere by geometrically congruent…