Related papers: Intersections of multicurves from Dynnikov coordin…
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…
Line intersection with convex and un-convex polygons or polyhedron algorithms are well known as line clipping algorithms and very often used in computer graphics. Rendering of geometrical problems often leads to ray tracing techniques, when…
Let $N_{g,n}$ be an $n$--punctured non--orientable surface of genus $g$ with one boundary component. For $g\geq 2$ one of the generators of the mapping class group of $N_{g,n}$ is a crosscap transposition. We give explicit formulae for the…
A disk graph is an intersection graph of disks in $\mathbb{R}^2$. Determining the computational complexity of finding a maximum clique in a disk graph is a long-standing open problem. In 1990, Clark, Colbourn, and Johnson gave a…
We study the following question: fix a sufficient general curve D of degree d in P^2, what is the least number of intersections between D and an irreducible curve of degree m? G. Xu proved this number i(d, m) is at least d - 2 for all m.…
We study the combinatorial complexity of D-dimensional polyhedra defined as the intersection of n halfspaces, with the property that the highest dimension of any bounded face is much smaller than D. We show that, if d is the maximum…
We derive various inequalities involving the intersection number of the curves contained in geodesics and tight geodesics in the curve graph. While there already exist such inequalities on tight geodesics, our method applies in the setting…
In this paper, we present an algorithm for computing a feedback vertex set of a unit disk graph of size $k$, if it exists, which runs in time $2^{O(\sqrt{k})}(n+m)$, where $n$ and $m$ denote the numbers of vertices and edges, respectively.…
Intersection graphs of planar geometric objects such as intervals, disks, rectangles and pseudo-disks are well studied. Motivated by various applications, Butman et al. in SODA 2007 considered algorithmic questions in intersection graphs of…
The problem deals with an exact calculation of the intersection area of a circle arbitrary placed on a grid of square shaped elements with gaps between them (finite fill factor). Usually an approximation is used for the calculation of the…
We present a $(1- \varepsilon)$-approximation algorithms for maximum cardinality matchings in disk intersection graphs -- all with near linear running time. We also present estimation algorithm that returns $(1\pm…
In this paper, using the formula for the integrals of the $\psi$-classes over the double ramification cycles found by S. Shadrin, L. Spitz, D. Zvonkine and the author, we derive a new explicit formula for the $n$-point function of the…
We formulate a simple algorithm for computing global exact symmetries of closed discrete curves in plane. The method is based on a suitable trigonometric interpolation of vertices of the given polyline and consequent computation of the…
We develop a multiresolution approach to the problem of polygonal curve approximation. We show theoretically and experimentally that, if the simplification algorithm A used between any two successive levels of resolution satisfies some…
We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality between successive levels of resolution using dynamic…
We describe an algorithmic reduction of the search for integral points on a curve y^2 = ax^4 + bx^2 + c with nonzero ac(b^2-4ac) to solving a finite number of Thue equations. While existence of such reduction is anticipated from arguments…
A geometric intersection graph is constructed over a set of geometric objects, where each vertex represents a distinct object and an edge connects two vertices if and only if the corresponding objects intersect. We examine the problem of…
Given a set of $n$ circular arcs of the same radius in the plane, we consider the problem of computing the number of intersections among the arcs. The problem was studied before and the previously best algorithm solves the problem in…
Given an ordered sequence of $N$-choose-2 integers, we give necessary and sufficient conditions to have an ordered collection of $N$ simple closed curves on a torus such that the algebraic pairwise intersections of those curves are the…
While well-known methods to list the intersections of either a list of segments or a complex polygon aim at achieving optimal time-complexity they often do so at the cost of memory comsumption and complex code. Real-life software…