Related papers: Intersection of paraboloids and application to Min…
We present an algorithm for calculating the geometric intersection number of two multicurves on the $n$-punctured disk, taking as input their Dynnikov coordinates. The algorithm has complexity $O(m^2n^4)$, where $m$ is the sum of the…
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…
Conical intersections are common in molecular physics and photochemistry, and are often invoked to explain observed reaction products. A conical intersection can occur when an excited electronic potential energy surface intersects with the…
We study the design of robust subexponential algorithms for classical connectivity problems on intersection graphs of similarly sized fat objects in $\mathbb{R}^d$. In this setting, each vertex corresponds to a geometric object, and two…
Intersection detection between three-dimensional bodies has various applications in computer graphics, video game development, robotics as well as military industries. In some respects, entities do not want to disclose sensitive information…
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…
The need to compute the intersections between a line and a high-order curve or surface arises in a large number of finite element applications. Such intersection problems are easy to formulate but hard to solve robustly. We introduce a…
We make explicit the geometric content of Mel'nikov's method for detecting heteroclinic points between transversally hyperbolic periodic orbits. After developing the general theory of intersections for pairs of family of Lagrangian…
We consider the N-vortex problem on a ellipsoid of revolution. Applying standard techniques of classical perturbation theory we construct a sequence of conformal transformations from the ellipsoid into the complex plane. Using these…
Given two matroids $\mathcal{M}_1 = (V, \mathcal{I}_1)$ and $\mathcal{M}_2 = (V, \mathcal{I}_2)$ over an $n$-element integer-weighted ground set $V$, the weighted matroid intersection problem aims to find a common independent set $S^{*} \in…
A recent series of papers has examined the extension of disjunctive-programming techniques to mixed-integer second-order-cone programming. For example, it has been shown---by several authors using different techniques---that the convex hull…
In this paper, a novel technique for tight outer-approximation of the intersection region of a finite number of ellipses in 2-dimensional (2D) space is proposed. First, the vertices of a tight polygon that contains the convex intersection…
The problem of finding a point in the intersection of closed sets can be solved by the method of alternating projections and its variants. It was shown in earlier papers that for convex sets, the strategy of using quadratic programming (QP)…
A central theme in extremal combinatorics is the study of the maximum number of edges in an $r$-uniform hypergraph ($r$-graph) with matching number at most $s$ (the Erd\H{o}s Matching Conjecture) or with pairwise intersection at least $t$…
The trajectories of the $\mathrm{O}(1)$-Kepler problem at level $n\ge 2$ are completely determined. It is found in particular that a non-colliding trajectory is an ellipse, a parabola or a branch of hyperbola according as the total energy…
We propose a new algorithm to compute the X-ray transform of an image represented by unit (pixel/voxel) basis functions. The fundamental issue is equivalently calculating the intersection lengths of the ray with associated units. For any…
Embedding graphs in a geographical or latent space, i.e.\ inferring locations for vertices in Euclidean space or on a smooth manifold or submanifold, is a common task in network analysis, statistical inference, and graph visualization. We…
We investigate the two problems of computing the union join graph as well as computing the subset graph for acyclic hypergraphs and their subclasses. In the union join graph $G$ of an acyclic hypergraph $H$, each vertex of $G$ represents a…
We consider the problem of minimizing a convex function over the intersection of finitely many simple sets which are easy to project onto. This is an important problem arising in various domains such as machine learning. The main difficulty…
The hypergraph Zarankiewicz's problem, introduced by Erd\H{o}s in 1964, asks for the maximum number of hyperedges in an $r$-partite hypergraph with $n$ vertices in each part that does not contain a copy of $K_{t,t,\ldots,t}$. Erd\H{o}s…