Related papers: Simultaneous Diagonal Flips in Plane Triangulation…
A geometric graph is a drawing of a graph in the plane where the vertices are drawn as points in general position and the edges as straight-line segments connecting their endpoints. It is plane if it contains no crossing edges. We study…
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…
A {\em $1-$vertex triangulation} of an oriented compact surface $S$ of genus $g$ is an embedded graph $T\subset S$ with a unique vertex such that all connected components of $S\setminus T$ are triangles (adjacent to exactly 3 edges of $T$).…
We present new triangulations of the $m=4$ amplituhedron relevant for scattering amplitudes in planar $\mathcal{N}=4$ super-Yang-Mills, obtained directly from the combinatorial definition of the geometry. Using the "sign flip"…
We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the mapping between the vertices of the two graphs is given and another where the mapping is not given. In particular,…
Given a triangulation of a closed topological cube, we show that (under some technical condition) there is an essentially unique tiling of a rectangular parallelepiped by cubes, indexed by the vertices of the triangulation. Moreover, i -…
We consider the problem of morphing between two planar drawings of the same triangulated graph, maintaining straight-line planarity. A paper in SODA 2013 gave a morph that consists of $O(n^2)$ steps where each step is a linear morph that…
In the present paper, we consider two applications of the pentagon equation. The first deals with actions of flips on edges of triangulations labelled by rational functions in some variables. The second can be formulated as a system of…
We derive improved upper bounds on the number of crossing-free straight-edge spanning cycles (also known as Hamiltonian tours and simple polygonizations) that can be embedded over any specific set of $N$ points in the plane. More…
We develop a systematic method for computing the angle combinations at all vertices in an edge-to-edge tiling of the sphere by pentagons with the same five angles. The method is a useful and necessary step in many tiling problems about…
In a region $R$ consisting of unit squares, a domino is the union of two adjacent squares and a (domino) tiling is a collection of dominoes with disjoint interior whose union is the region. The flip graph $\mathcal{T}(R)$ is defined on the…
In this paper, we show that two balanced triangulations of a closed surface are not necessary connected by a sequence of balanced stellar subdivisions and welds. This answers a question posed by Izmestiev, Klee and Novik. We also show that…
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…
We provide an algorithm for computing a planar morph between any two planar straight-line drawings of any $n$-vertex plane graph in $O(n)$ morphing steps, thus improving upon the previously best known $O(n^2)$ upper bound. Further, we prove…
Given a set of $n$ points $S$ in the plane, a triangulation $T$ of $S$ is a maximal set of non-crossing segments with endpoints in $S$. We present an algorithm that computes the number of triangulations on a given set of $n$ points in time…
There are exactly eight edge-to-edge tilings of the sphere by congruent equilateral pentagons: three pentagonal subdivision tilings with 12, 24, 60 tiles; four earth map tilings with 16, 20, 24, 24 tiles; and one flip modification of the…
We show that any $3$-connected cubic plane graph on $n$ vertices, with all faces of size at most $6$, can be made bipartite by deleting no more than $\sqrt{(p+3t)n/5}$ edges, where $p$ and $t$ are the numbers of pentagonal and triangular…
Given a set S of n points in R^D, and an integer k such that 0 <= k < n, we show that a geometric graph with vertex set S, at most n - 1 + k edges, maximum degree five, and dilation O(n / (k+1)) can be computed in time O(n log n). For any…
In this paper, we discuss matching extendability of optimal $1$-projective plane graphs (abbreviated as O1PPG), which are drawn on the projective plane $P^2$ so that every edge crosses another edge at most once, and has $n$ vertices and…
Consider a graph drawn on a surface (for example, the plane minus a finite set of obstacle points), possibly with crossings. We provide an algorithm to decide whether such a drawing can be untangled, namely, if one can slide the vertices…