English
Related papers

Related papers: Non-self-intersective dragon curves

200 papers

We prove that the number of tangencies between the members of two families, each of which consists of $n$ pairwise disjoint curves, can be as large as $\Omega(n^{4/3})$. We show that from a conjecture about forbidden $0$-$1$ matrices it…

Combinatorics · Mathematics 2022-04-25 Balázs Keszegh , Dömötör Pálvölgyi

By a poly-line drawing of a graph G on n vertices we understand a drawing of G in the plane such that each edge is represented by a polygonal arc joining its two respective vertices. We call a turning point of a polygonal arc the bend. We…

Combinatorics · Mathematics 2010-02-15 Radoslav Fulek , Balázs Keszegh , Filip Morić

We consider the sharp interface limit of the Allen-Cahn equation with homogeneous Neumann boundary condition in a two-dimensional domain $\Omega$, in the situation where an interface has developed and intersects $\partial\Omega$. Here a…

Analysis of PDEs · Mathematics 2018-06-07 Helmut Abels , Maximilian Moser

A geometric graph in the plane is angle-monotone of width $\gamma$ if every pair of vertices is connected by an angle-monotone path of width $\gamma$, a path such that the angles of any two edges in the path differ by at most $\gamma$.…

Computational Geometry · Computer Science 2018-01-22 Anna Lubiw , Debajyoti Mondal

Computing the diameter of the intersection graphs of objects is a basic problem in computational geometry. Previous works showed that the complexity of computing the diameter mainly depends on the object types: for unit disks and squares in…

Computational Geometry · Computer Science 2026-05-12 Timothy M. Chan , Hsien-Chih Chang , Jie Gao , Sándor Kisfaludi-Bak , Hung Le , Da Wei Zheng

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

We prove that the number of real intersection points of a real line with a real plane curve defined by a polynomial with at most t monomials is either infinite or does not exceed 6t -7. This improves a result by M. Avendano. Furthermore, we…

Algebraic Geometry · Mathematics 2015-06-11 Frédéric Bihan , Boulos El Hilany

A plane curve $C\subset\mathbb{P}^2$ of degree $d$ is called \emph{blocking} if every $\mathbb{F}_q$-line in the plane meets $C$ at some $\mathbb{F}_q$-point. We prove that the proportion of blocking curves among those of degree $d$ is…

Algebraic Geometry · Mathematics 2024-02-20 Shamil Asgarli , Dragos Ghioca , Chi Hoi Yip

A collection $ \Delta $ of simple closed curves on an orientable surface is an algebraic $ k $-system if the algebraic intersection number $\langle \alpha,\beta \rangle$ is equal to $k $ in absolute value for every $ \alpha , \beta \in…

Geometric Topology · Mathematics 2020-02-17 Charles Daly , Jonah Gaster , Max Lahn , Aisha Mechery , Simran Nayak

In this paper we analyze the intersection between the norm-trace curve over $\mathbb{F}_{q^3}$ and the curves of the form $y=ax^3+bx^2+cx+d$, giving a complete characterization of the intersection between the curve and the parabolas, as…

Combinatorics · Mathematics 2020-03-09 Matteo Bonini , Massimiliano Sala

Simple drawings are drawings of graphs in which the edges are Jordan arcs and each pair of edges share at most one point (a proper crossing or a common endpoint). We introduce a special kind of simple drawings that we call generalized…

Computational Geometry · Computer Science 2022-03-14 Oswin Aichholzer , Alfredo García , Javier Tejel , Birgit Vogtenhuber , Alexandra Weinberger

In the mid eighties Goldman proved an embedded curve could be isotoped to not intersect a closed geodesic if and only if their Lie bracket (as defined in that work) vanished. Goldman asked for a topological proof and about extensions of the…

Geometric Topology · Mathematics 2016-11-16 Moira Chas , Siddhartha Gadgil

Simple closed curves in the plane can be mapped to nontrivial knots under the action of origami foldings that allow the paper to self-intersect. We show all tame knot types may be produced in this manner, motivating the development of a new…

Geometric Topology · Mathematics 2021-05-05 Joseph Slote , Thomas Bertschinger

An outerstring graph is an intersection graph of curves that lie in a common half-plane and have one endpoint on the boundary of that half-plane. We prove that the class of outerstring graphs is $\chi$-bounded, which means that their…

Combinatorics · Mathematics 2018-12-04 Alexandre Rok , Bartosz Walczak

A simple closed curve $\gamma$ in the real projective plane $P^2$ is called anti-convex if for each point $p$ on the curve, there exists a line which is transversal to the curve and meets the curve only at $p$. We shall prove the relation…

Differential Geometry · Mathematics 2007-05-23 Gudlaugur Thorbergsson , Masaaki Umehara

An arrangement of pseudocircles is a collection of simple closed curves on the sphere or in the plane such that any two of the curves are either disjoint or intersect in exactly two crossing points. We call an arrangement intersecting if…

Computational Geometry · Computer Science 2020-01-17 Stefan Felsner , Manfred Scheucher

We calculate the intersection ring of three-dimensional graph manifolds with rational coefficients and give an algebraic characterization of these rings when the manifold's underlying graph is a tree. We are able to use this…

Geometric Topology · Mathematics 2015-03-23 Margaret I. Doig , Peter D. Horn

In this article, we consider `$N$'spherical caps of area $4\pi p$ were uniformly distributed over the surface of a unit sphere. We study the random intersection graph $G_N$ constructed by these caps. We prove that for $p =…

Probability · Mathematics 2008-09-09 Bhupendra gupta

A pseudocircle is a simple closed curve on the sphere or in the plane. The study of arrangements of pseudocircles was initiated by Gr\"unbaum, who defined them as collections of simple closed curves that pairwise intersect in exactly two…

Computational Geometry · Computer Science 2020-01-20 Stefan Felsner , Manfred Scheucher

Let $G$ be a simple topological graph and let $\Gamma$ be a polyline drawing of $G$. We say that $\Gamma$ \emph{partially preserves the topology} of $G$ if it has the same external boundary, the same rotation system, and the same set of…

Computational Geometry · Computer Science 2018-09-24 Emilio Di Giacomo , Peter Eades , Giuseppe Liotta , Henk Meijer , Fabrizio Montecchiani