Related papers: Simplicial embeddings between multicurve graphs
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show the surprising fact that it is NP-hard to compute the crossing number of near-planar graphs. A graph is 1-planar if it has a drawing where every…
We use Poonen's closed point sieve to prove two independent results. First, we show that the obvious obstruction to embedding a curve in a smooth surface is the only obstruction over a perfect field, by proving the finite field analogue of…
We prove the existence of embedded closed constant curvature curves on convex surfaces.
We consider collections of disjoint simple closed curves in a compact orientable surface which decompose the surface into pairs of pants. The isotopy classes of such curve systems form the vertices of a 2-complex, whose edges correspond to…
In this paper we investigate the problem of interpolating a B-spline curve network, in order to create a surface satisfying such a constraint and defined by blending functions spanning the space of bivariate $C^1$ quadratic splines on…
Whitney proved that 3-connected planar graphs admit a unique embedding on the sphere. In contrast, Enami investigated embeddings of 3-connected cubic planar graphs on non-spherical surfaces with non-negative Euler characteristic. He…
We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…
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…
This paper is the fifth and final in a series on embedded minimal surfaces. Following our earlier papers on disks, we prove here two main structure theorems for non-simply connected embedded minimal surfaces of any given fixed genus. The…
Let R be a compact, connected, orientable surface of genus g with p boundary components. Let C(R) be the complex of curves on R and Mod_R^* be the extended mapping class group of R. Suppose that either g = 2 and p > 1 or g > 2 and p >= 0.…
I answer an open question left by Gui-Song Li in "On self-intersections of immersed surfaces" (AMS Proceedings, Volume 126, 1998, pp.3721-3726.) The intersection graph $M(i)$ of a generic surface $i:F \to S^3$ is the set of values which are…
We define graftable curves on real projective surfaces. In particular, we construct graftable ones in Hitchin case and show that real projective structures with the same Hitchin holonomy, carrying the same weight type, are related to each…
We investigate the problem of constructing planar drawings with few bends for two related problems, the partially embedded graph problem---to extend a straight-line planar drawing of a subgraph to a planar drawing of the whole graph---and…
This paper explores the relationship between closed curves on surfaces and their intersections. Like Dehn-Thurston coordinates for simple curves, we explore how to determine closed curves using the number of times they intersect other…
Hypergraphs are a generalization of graphs in which edges can connect any number of vertices. They allow the modeling of complex networks with higher-order interactions, and their spectral theory studies the qualitative properties that can…
We show how to test the bipartiteness of an intersection graph of n line segments or simple polygons in the plane, or of balls in R^d, in time O(n log n). More generally we find subquadratic algorithms for connectivity and bipartiteness…
Any pair of intersecting cylinders on a translation surface is "coherent," in that the geometric and algebraic intersection numbers of their core curves are equal (up to sign). In this paper, we investigate when a pair of multicurves can be…
Surfaces and curves play an important role in geometric design. In recent years, problem of finding a surface passing through a given curve have attracted much interest. In the present paper, we propose a new method to construct a surface…
Graph embedding, especially as a subgraph of a grid, is an old topic in VLSI design and graph drawing. In this paper, we investigate related questions concerning the complexity of embedding a graph $G$ in a host graph that is the strong…
A string graph is an intersection graph of curves in the plane. A $k$-string graph is a graph with a string representation in which every pair of curves intersects in at most $k$ points. We introduce the class of $(=k)$-string graphs as a…