Related papers: Intersections of multicurves from Dynnikov coordin…

To support exactly tracking a neutron moving along a given line segment through a CAD model with quadric surfaces, this paper considers the arithmetic precision required to compute the order of intersection points of two quadrics along the…

We generalize two classical formulas for complete intersection curves by introducing the the complete intersection discrepancy of a curve as a correction term. The first is a well-known multiplicity formula in singularity theory, due to…

We consider the problem of finding all allowed edges in a bipartite graph $G=(V,E)$, i.e., all edges that are included in some maximum matching. We show that given any maximum matching in the graph, it is possible to perform this…

Given a set $P$ of $n$ weighted points and a set $S$ of $m$ disks in the plane, the hitting set problem is to compute a subset $P'$ of points of $P$ such that each disk contains at least one point of $P'$ and the total weight of all points…

Take a circle and mark $n\in\mathbb{N}$ points on it designated as vertices. For any arc segment between two consecutive vertices which does not pass through any other vertex, there is a disk centered at its midpoint and has its end points…

This paper focuses on intersection of closed curves on translation surfaces. Namely, we investigate the question of determining the intersection of two closed curves of a given length on such surfaces. This question has been investigated in…

The definition of the intersection number of a map with a closed manifold can be extended to the case of a closed stratified set such that the difference between dimensions of its two biggest strata is greater than $1$. The set Sigma of…

This paper shows a polynomial-time algorithm, that given a general matroid $M_1 = (X, \mathcal{I}_1)$ and $k-1$ partition matroids $ M_2, \ldots, M_k$, produces a coloring of the intersection $M = \cap_{i=1}^k M_i$ using at most…

This article presents numerical methods in order to solve problems of tolerance analysis. A geometric specification, a contact specification and a functional requirement can be respectively characterized by a finite set of geometric…

In this article we give a computational study of combinatorics of the discriminantal arrangements. The discriminantal arrangements are parametrized by two positive integers n and k such that n>k. The intersection lattice of the…

Using the connection between intersection theory on the Deligne-Mumford spaces and the edge scaling of the GUE matrix model (see math.CO/9903176, math.AG/0101147), we express the n-point functions for the intersection numbers as…

For two oriented simple closed curves on a compact orientable surface with a connected boundary we introduce a simple computation of a value in the first homology group of the surface, which detects in some cases that the geometric…

Recent research on computing the diameter of geometric intersection graphs has made significant strides, primarily focusing on the 2D case where truly subquadratic-time algorithms were given for simple objects such as unit-disks and…

In this paper, we study the many-to-many matching problem on planar point sets with integer coordinates: Given two disjoint sets $R,B \subset [\Delta]^2$ with $|R|+|B|=n$, the goal is to select a set of edges between $R$ and $B$ so that…

Polynomial algorithms are given for the following two problems: given a graph with $n$ vertices and $m$ edges, where $m \ge 3 n^{3/2}$, find a complete balanced bipartite subgraph with parts about $\ln n/(\ln (n^2/m))$, given a graph with…

In previous work we computed the symplectic volume of the symplectic reduced space of the product of N adjoint orbits of a compact Lie group. In this paper we compute the intersection pairings of the same object.

In this paper we express any intersection number $(L_1\cdot\ldots\cdot L_d)$ of ample line bundles on an irreducible projective variety as the mixed volume $V(\Delta_{Y_\bullet}(L_1),\dots,\Delta_{Y_\bullet}(L_d))$ of their Newton-Okounkov…

In this short article, we find an explicit formula for Maslov index of Whitney n-gons joining intersections points of n half-dimensional tori in the symmetric product of a surface. The method also yields a formula for the intersection…

Finding the intersection of two conics is a commonly occurring problem. For example, it occurs when identifying patterns of craters on the lunar surface, detecting the orientation of a face from a single image, or estimating the attitude of…

Using the Semple bundle construction, we derive an intersection-theoretic formula for the number of simultaneous contacts of specified orders between members of a generic family of degree $d$ plane curves and finitely many fixed curves. The…