Related papers: On the Intersection of Two Conics
We present a framework to obtain valid inequalities for a reverse convex set: the set of points in a polyhedron that lie outside a given open convex set. Reverse convex sets arise in many models, including bilevel optimization and…
A realistic generalization of the Markov--Dubins problem, which is concerned with finding the shortest planar curve of constrained curvature joining two points with prescribed tangents, is the requirement that the curve passes through a…
We present a mathematical and algorithmic scheme for learning the principal geometric elements in an image or 3D object. We build on recent work that convexifies the basic problem of finding a combination of a small number shapes that…
Many problems give rise to polynomial systems. These systems often have several parameters and we are interested to study how the solutions vary when we change the values for the parameters. Using predictor-corrector methods we track the…
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…
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…
Several intersection matrices of $s$-subsets vs. $k$-subsets of a $v$-set are introduced in the literature. We study these matrices systematically through counting arguments and generating function techniques. A number of new or known…
We put forward a radial principle and a degeneracy locating principle of decoupling. The former generalises the Pramanik-Seeger argument used in the proof of decoupling for the light cone. The latter locates the degenerate part of a…
We provide a remarkably simple algorithm to compute all (at most four) common tangents of two disjoint simple polygons. Given each polygon as a read-only array of its corners in cyclic order, the algorithm runs in linear time and constant…
We investigate completed interlacing of zeros for pairs of polynomial sequences that fail to interlace by exactly two points. Using a general mixed recurrence relation, we identify a quadratic polynomial whose zeros serve as the two extra…
We present a concise self-contained inversive geometry solution of the three-circle problem of Steiner of constructing a circle that intersects each of the three given circles at one of the three given angles.
We present a, hopefully, elementary mathematical treatment of the computational aspects of congruent numbers, such that an amateur could understand the problem and perform their own calculations.
An interesting problem in solid state physics is to compute discrete breather solutions in $\mathcal{N}$ coupled 1--dimensional Hamiltonian particle chains and investigate the richness of their interactions. One way to do this is to compute…
Locally analytically, any isolated double point occurs as a double covering of a smooth surface. It can be desingularized via the canonical resolution, as it is well-known. In this paper we explicitly compute the fundamental cycle of both…
Principal angles between subspaces (PABS) (also called canonical angles) serve as a classical tool in mathematics, statistics, and applications, e.g., data mining. Traditionally, PABS are introduced via their cosines. The cosines and sines…
In this work we present a unified method of relative camera pose estimation from points and lines correspondences. Given a set of 2D points and lines correspondences in three views, of which two are known, a method has been developed for…
Given two distinct reduced, irreducible curves of given degrees, contained in projective space but whose union is not contained in a hyperplane, what is the largest number of points of intersection they can have? When the projective space…
The goal of this paper is to determine the number of perpendicularly inscribed polygons that intersect a given side of a regular polygon with an odd number of sides. This is done using circular permutations with repetition, and some special…
The computation of the topology of a real algebraic plane curve is greatly simplified if there are no more than one critical point in each vertical line: the general position condition. When this condition is not satisfied, then a finite…
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…