Related papers: Generating maps on surfaces
We describe some theoretical results on triangulations of surfaces and we develop a theory on roots, decompositions and genus-surfaces. We apply this theory to describe an algorithm to list all triangulations of closed surfaces with at most…
Which surfaces can be realized with two-dimensional faces of the five-dimensional cube (the penteract)? How can we visualize them? In recent work, Aveni, Govc, and Roldan, show that there exist 2690 connected closed cubical surfaces up to…
For a graph embedded into a surface, we relate many combinatorial parameters of the cycle matroid of the graph and the bond matroid of the dual graph with the topological parameters of the embedding. This will give an expression of the…
We show that there exists a geodesic triangulation $T$ of a hyperbolic genus 2 surface $\Sigma_2$ with 10 vertices and an isometric polyhedral embedding $S: \Sigma_2 \hookrightarrow \mathbb{H}^3$ that sends the triangles in $T$ to geodesic…
We present a fast enumeration algorithm for combinatorial 2- and 3-manifolds. In particular, we enumerate all triangulated surfaces with 11 and 12 vertices and all triangulated 3-manifolds with 11 vertices. We further determine all…
Closed-form generating functions for counting one-face rooted hypermaps with a known number of darts by number of vertices and edges is found, using matrix integral expressions relating to the reduced density operator of a bipartite quantum…
A result due to Burago and Zalgaller (1960, 1995) states that every orientable polyhedral surface, one that is obtained by gluing Euclidean polygons, has an isometric piecewise linear (PL) embedding into Euclidean space $\mathbb{E}^3$. A…
Bipartite graphs model the relationships between two disjoint sets of entities in several applications and are naturally drawn as 2-layer graph drawings. In such drawings, the two sets of entities (vertices) are placed on two parallel lines…
The goal of this paper is to establish the classification of all homogeneous surfaces of 3-sphere by using the moving frame method. We will show that such surfaces are 2-spheres and flat torus.
Let X be a closed surface of genus two embedded in the 3-sphere. Then X inherits a metric and an orientation, which give an almost complex structure, which automatically integrates to a genuine complex structure, making X a Riemann surface.…
In this paper we describe a physical problem, based on electromagnetic fields, whose topological constraints are higher dimensional versions of Kirchhoff's laws, involving $2-$ simplicial complexes embedded in $\mathbb{R} ^3$ rather than…
Inspired by the Taubes-Wu construction of $\mathcal{C}^{1,\alpha}$ two-valued harmonic functions by the use of symmetry, we construct minimal surfaces with stratified branching sets as graphs of $\mathcal{C}^{1,\alpha}$ two-valued…
We prove that circle graphs (intersection graphs of circle chords) can be embedded as intersection graphs of rays in the plane with polynomial-size bit complexity. We use this embedding to show that the global curve simplification problem…
We construct examples of flat surfaces in $\mathbb{H}^3$ which are graphs over a two-punctured horosphere and classify complete embedded flat surfaces in $\mathbb{H}^3$ with only one end and at most two isolated singularities.
We study hyperbolic polyhedral surfaces with faces isometric to regular hyperbolic polygons satisfying that the total angles at vertices are at least $2\pi.$ The combinatorial information of these surfaces is shown to be identified with…
We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique applies to general families of problems where standard dynamic…
Traditional representations of graphs and their duals suggest the requirement that the dual vertices be placed inside their corresponding primal faces, and the edges of the dual graph cross only their corresponding primal edges. We consider…
The goal of this study is to provide a method for computing the following: Given a network of curves in 3d (satisfying a condition at the intersection points), compute efficiently a smooth surface such that the curves are geodesics on it.…
A simple topological graph $G$ is a graph drawn in the plane so that any pair of edges have at most one point in common, which is either an endpoint or a proper crossing. $G$ is called saturated if no further edge can be added without…
We construct closed embedded minimal surfaces in the round three-sphere, resembling two parallel copies of the equatorial two-sphere, joined by small catenoidal bridges symmetrically arranged either along two parallel circles of the…