Related papers: Growing uniform planar maps face by face
We derive, in order of magnitude, the observed astrophysical and cosmological scales in the Universe, from neutron stars to superclusters of galaxies, up to, asymptotically, the observed radius of the Universe. This result is obtained by…
Making use of integral representations, we develop a unified approach to establish blow up profiles, compactness and existence of positive solutions of the conformally invariant equations $P_\sigma(v)= Kv^{\frac{n+2\sigma}{n-2\sigma}}$ on…
Given a subset of size $k$ of a very large universe a randomized way to find this subset could consist of deleting half of the universe and then searching the remaining part. With a probability of $2^{-k}$ one will succeed. By probability…
Four mutually tangent spheres form two gaps. In each of these, one can inscribe in a unique way four mutually tangent spheres such that each one of these spheres is tangent to exactly three of the original spheres. Repeating the process…
Starting from an arbitrary sequence of polygons whose total perimeter is $2n$, we can build an (oriented) surface by pairing their sides in a uniform fashion. Chmutov and Pittel (arXiv:1503.01816) have shown that, regardless of the…
We present a method for fine-grained face manipulation. Given a face image with an arbitrary expression, our method can synthesize another arbitrary expression by the same person. This is achieved by first fitting a 3D face model and then…
We study the set of image tuples arising from fixed cameras observing varying planar 3-dimensional point configurations. We derive a formula for the number of complex critical points of the triangulation problem, which seeks to reconstruct…
Kupavskii, Volostnov, and Yarovikov have recently shown that any set of $n$ points in general position in the plane has at least as many (partial) triangulations as the convex $n$-gon. We generalize this in two directions: we show that…
We describe a method for discretizing planar C2-regular domains immersed in non-conforming triangulations. The method consists in constructing mappings from triangles in a background mesh to curvilinear ones that conform exactly to the…
We construct a family of PL triangulations of the $d$-dimensional real projective space $\mathbb{R}P^d$ on $\Theta((\frac{1+\sqrt{5}}{2})^{d+1})$ vertices for every $d\geq 1$. This improves a construction due to K\"{u}hnel on $2^{d+1}-1$…
A transformation based on mean curvature is introduced which morphs triangulated surfaces into round spheres.
With the help of hyper-ideal circle pattern theory, we have developed a discrete version of the classical uniformization theorems for surfaces represented as finite branched covers over the Riemann sphere as well as compact polyhedral…
The Carrell-Chapuy recurrence formulas dramatically improve the efficiency of counting orientable rooted maps by genus, either by number of edges alone or by number of edges and vertices. This paper presents an implementation of these…
If a collection of identical particles is poured into a container, different shapes will fill to different densities. But what is the shape that fills a container as close as possible to a pre-specified, desired density? We demonstrate a…
We study the set of lines that meet a fixed line and are tangent to two spheres and classify the configurations consisting of a single line and three spheres for which there are infinitely many lines tangent to the three spheres that also…
We study the problem of convexifying drawings of planar graphs. Given any planar straight-line drawing of an internally 3-connected graph, we show how to morph the drawing to one with strictly convex faces while maintaining planarity at all…
Simplicial surfaces describe the incidence relations between vertices, edges and faces of triangulated 2-dimensional manifolds in a purely combinatorial way. By considering only the incidences of edges and faces, simplicial surfaces are…
Untangling is a process in which some vertices of a planar graph are moved to obtain a straight-line plane drawing. The aim is to move as few vertices as possible. We present an algorithm that untangles the cycle graph C_n while keeping at…
We give presentations of the planar algebra of unipotent representations of the groups $\mathbb{C}$ and $\mathbb{F}_p$ under addition using jellyfish and light leaf style arguments. These are some of the most natural examples of…
Sphere eversions have been described so far by either pictures with minimal topological complexity, numerical evolution or complex equations. We write down relatively simple explicit formulas for the whole eversion, both analytic and…