Related papers: Intersections of multicurves from Dynnikov coordin…

In this paper we study relations between intersection numbers on moduli spaces of curves and Hurwitz numbers. First, we prove two formulas expressing Hurwitz numbers of (generalized) polynomials via intersections on moduli spaces of curves.…

In the realm of computer-aided design (CAD) software, the intersection of B-spline surfaces stands as a fundamental operation. Despite the extensive history of surface intersection algorithms, the challenge of handling complex intersection…

For any simple digraph $D$ we offer a new proof for the intersection number of its middle digraph, $M(D)$; while doing so we also solve for the intersection number when $D$ has loops. In addition, a new transformation, the union of $D$ and…

We present a Melnikov type approach for establishing transversal intersections of stable/unstable manifolds of perturbed normally hyperbolic invariant manifolds. We do not need to know the explicit formulas for the homoclinic orbits prior…

We construct a new quantum algorithm for the graph collision problem; that is, the problem of deciding whether the set of marked vertices contains a pair of adjacent vertices in a known graph G. The query complexity of our algorithm is…

We identify the formulas of Buryak and Okounkov for the n-point functions of the intersection numbers of psi-classes on the moduli spaces of curves. This allows us to combine the earlier known results and this one into a principally new…

We present an implementation of a recent algorithm to compute shortest-path trees in unit disk graphs in $O(n\log n)$ worst-case time, where $n$ is the number of disks. In the minimum-separation problem, we are given $n$ unit disks and two…

We propose a method to compute the numerical solutions of a polynomial system in complete intersection. This algorithm makes use of Bezout matrices and need only linear algebra computations. All the calculations can be done in floating…

We study a path-planning problem amid a set $\mathcal{O}$ of obstacles in $\mathbb{R}^2$, in which we wish to compute a short path between two points while also maintaining a high clearance from $\mathcal{O}$; the clearance of a point is…

We address the problem of computing bounds for the self-intersection number (the minimum number of self-intersection points) of members of a free homotopy class of curves in the doubly-punctured plane as a function of their combinatorial…

We outline a strategy for computing intersection numbers on smooth varieties with torus actions using a residue formula of Bott. As an example, Gromov-Witten numbers of twisted cubic and elliptic quartic curves on some general complete…

We give a formula for the number of interior intersection points made by the diagonals of a regular $n$-gon. The answer is a polynomial on each residue class modulo 2520. We also compute the number of regions formed by the diagonals, by…

We initiate the study of diameter computation in geometric intersection graphs from the fine-grained complexity perspective. A geometric intersection graph is a graph whose vertices correspond to some shapes in $d$-dimensional Euclidean…

We introduce an operation that measures the self intersections of paths on a surface. As applications, we give a criterion of the realizability of a generalized Dehn twist, and derive a geometric constraint on the image of the Johnson…

We estimate from below the number of lines meeting each of given 4 disjoint smooth closed curves in a given cyclic order in the real projective 3-space and in a given linear order in the Euclidean 3-space. Similarly, we estimate the number…

We study incidences between points and algebraic curves in three dimensions, taken from a family $C$ of curves that have almost two degrees of freedom, meaning that every pair of curves intersect in $O(1)$ points, for any pair of points…

The intersection graph of a collection of trapezoids with corner points lying on two parallel lines is called a trapezoid graph. Using binary indexed tree data structure, we improve algorithms for calculating the size and the number of…

In this paper, we propose a method to cluster multiple intersected manifolds. The algorithm chooses several landmark nodes randomly and then checks whether there is an angle constrained path between each landmark node and every other node…

In this paper, we study the computation of curvatures at the singular points of algebraic curves and surfaces. The idea is to convert the problem to compute the curvatures of the corresponding regular parametric curves and surfaces, which…

We generalize univariate multipoint evaluation of polynomials of degree n at sublinear amortized cost per point. More precisely, it is shown how to evaluate a bivariate polynomial p of maximum degree less than n, specified by its n^2…