English
Related papers

Related papers: Untangling two systems of noncrossing curves

200 papers

This note discusses the structure of J-holomorphic curves in symplectic 4-manifolds (M,\om) when J\in \Jj(\Ss), the set of \om-tame J for which a fixed chain \Ss of transversally intersecting embedded spheres of self-intersection \le -2 is…

Symplectic Geometry · Mathematics 2013-05-02 Dusa McDuff

For a hypergraph $\mathcal{H}=(X,\mathcal{E})$ a \emph{support} is a graph $G$ on $X$ such that for each $E\in\mathcal{E}$, the induced subgraph of $G$ on the elements in $E$ is connected. If $G$ is planar, we call it a planar support. A…

Computational Geometry · Computer Science 2024-10-04 Ambar Pal , Rajiv Raman , Saurabh Ray , Karamjeet Singh

An "origami" (or flat structure) on a closed oriented surface, $S_g$, of genus $g \geq 2$ is obtained from a finite collection of unit Euclidean squares by gluing each right edge to a left one and each top edge to a bottom one. The main…

Geometric Topology · Mathematics 2021-05-11 Hong Chang , Xifeng Jin , William W. Menasco

The SetCover problem has been extensively studied in many different models of computation, including parallel and distributed settings. From an approximation point of view, there are two standard guarantees: an $O(\log…

Data Structures and Algorithms · Computer Science 2024-10-18 Laxman Dhulipala , Michael Dinitz , Jakub Łącki , Slobodan Mitrović

Let M be a compact connected orientable 3-manifold, with non-empty boundary that contains no 2-spheres. We investigate the existence of two properly embedded disjoint surfaces S_1 and S_2 such that M - (S_1 \cup S_2) is connected. We show…

Geometric Topology · Mathematics 2012-09-17 Marc Lackenby

We consider $n$-folding triangular curves, or $n$-folding t-curves, obtained by folding $n$ times a strip of paper in $3$, each time possibly left then right or right then left, and unfolding it with $\pi /3$ angles. An example is the well…

Combinatorics · Mathematics 2023-10-31 Francis Oger

There has recently been much progress on exact algorithms for the (un)weighted graph (bi)partitioning problem using branch-and-bound and related methods. In this note we present and improve an easily computable, purely combinatorial lower…

Data Structures and Algorithms · Computer Science 2014-10-03 Jesper Larsson Träff , Martin Wimmer

We study noncrossing geometric graphs and their disjoint compatible geometric matchings. Given a cycle (a polygon) P we want to draw a set of pairwise disjoint straight-line edges with endpoints on the vertices of P such that these new…

Combinatorics · Mathematics 2020-08-20 Alexander Pilz , Jonathan Rollin , Lena Schlipf , André Schulz

A surface embedded in space, in such a way that each point has a neighborhood within which the surface is a terrain, projects to an immersed surface in the plane, the boundary of which is a self-intersecting curve. Under what circumstances…

Computational Geometry · Computer Science 2008-06-11 David Eppstein , Elena Mumford

In this paper, we provide new discrete uniformization theorems for bounded, $m$-connected planar domains. To this end, we consider a planar, bounded, $m$-connected domain $\Omega$ and let $\bord\Omega$ be its boundary. Let $\mathcal{T}$…

Geometric Topology · Mathematics 2013-12-24 Sa'ar Hersonsky

Topological structure of minimal sets is studied for a dynamical system $(E,F)$ given by a fibre-preserving, in general non-invertible, continuous selfmap $F$ of a graph bundle $E$. These systems include, as a very particular case,…

Dynamical Systems · Mathematics 2014-10-14 Sergii Kolyada , Ľubomír Snoha , Sergei Trofimchuk

We establish new bounds on the number of tangencies and orthogonal intersections determined by an arrangement of curves. First, given a set of $n$ algebraic plane curves, we show that there are $O(n^{3/2})$ points where two or more curves…

Combinatorics · Mathematics 2018-07-10 Jordan S. Ellenberg , Jozsef Solymosi , Joshua Zahl

We study a question that lies at the intersection of classical research subjects in Topological Graph Theory and Graph Drawing: Computing a drawing of a graph with a prescribed number of crossings on a given set $S$ of points, while…

Computational Geometry · Computer Science 2025-08-27 Giuseppe Di Battista , Giuseppe Liotta , Maurizio Patrignani , Antonios Symvonis , Ioannis G. Tollis

A pseudocircle is a simple closed curve on some surface; an arrangement of pseudocircles is a collection of pseudocircles that pairwise intersect in exactly two points, at which they cross. Ortner proved that an arrangement of pseudocircles…

Given a planar graph $G$, we consider drawings of $G$ in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an injective embedding $\pi$ of the vertex set of $G$ into…

Discrete Mathematics · Computer Science 2011-05-20 Mihyun Kang , Oleg Pikhurko , Alexander Ravsky , Mathias Schacht , Oleg Verbitsky

We consider systems of simple closed curves on surfaces and their total number of intersection points, their so-called crossing number. For a fixed number of curves, we aim to minimise the crossing number. We determine the minimal crossing…

Geometric Topology · Mathematics 2024-03-11 Jasmin Jörg

We prove two theorems about homotopies of curves on 2-dimensional Riemannian manifolds. We show that, for any epsilon > 0, if two simple closed curves are homotopic through curves of bounded length L, then they are also isotopic through…

Differential Geometry · Mathematics 2014-01-10 Gregory R. Chambers , Yevgeny Liokumovich

We consider orientation-preserving actions of finite groups $G$ on pairs $(S^3, \Sigma)$, where $\Sigma$ denotes a compact connected surface embedded in $S^3$. In a previous paper, we considered the case of closed, necessarily orientable…

Geometric Topology · Mathematics 2017-10-26 Chao Wang , Shicheng Wang , Yimu Zhang , Bruno Zimmermann

For a Riemannian manifold $M^{n+1}$ and a compact domain $\Omega \subset M^{n+1}$ bounded by a hypersurface $\partial \Omega$ with normal curvature bounded below, estimates are obtained in terms of the distance from $O$ to $\partial \Omega$…

Differential Geometry · Mathematics 2015-06-12 Alexander Borisenko , Kostiantyn Drach

We consider upward-planar layered drawings of directed graphs, i.e., crossing-free drawings in which each edge is drawn as a y-monotone curve going upward from its tail to its head, and the y-coordinates of the vertices are integers. The…

Computational Geometry · Computer Science 2026-05-04 Patrizio Angelini , Sabine Cornelsen , Giordano Da Lozzo , Fabrizio Frati , Philipp Kindermann , Ignaz Rutter , Johannes Zink