Related papers: Efficient Detection of Borromean Linking in Ellips…
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…
For an even set of points in the plane, choose a max-sum matching, that is, a perfect matching maximizing the sum of Euclidean distances of its edges. For each edge of the max-sum matching, consider the ellipse with foci at the edge's…
The problem of finding elliptical shapes in an image will be considered. We discuss the solution which uses cross-entropy clustering. The proposed method allows the search for ellipses with predefined sizes and position in the space.…
Various packing problems and simulations of hard and soft interacting particles, such as microscopic models of nematic liquid crystals, reduce to calculations of intersections and pair interactions between ellipsoids. When constrained to a…
We present a general algorithm for finding the overlap area between two ellipses. The algorithm is based on finding a segment area (the area between an ellipse and a secant line) given two points on the ellipse. The Gauss-Green formula is…
We discuss the combining of measurements where single measurement covariances are given but the joint measurement covariance is unknown. For this paper we assume the mapping of a single measurement to the solution space is the identity…
We consider the problem of inferring the topology of a network using the measurements available at the end nodes, without cooperation from the internal nodes. To this end, we provide a simple method to obtain path interference which…
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 describe an algorithm for computing boundary slopes of 2-bridge links. As an example, we work out the slopes of the links obtained by 1/k surgery on one component of the Borromean rings. A table of all boundary slopes of all 2-bridge…
Detecting elliptical objects from an image is a central task in robot navigation and industrial diagnosis where the detection time is always a critical issue. Existing methods are hardly applicable to these real-time scenarios of limited…
We present a novel method for deciding whether a given n-dimensional ellipsoid contains another one (possibly with a different center). This method consists in constructing a particular concave function and deciding whether it has any value…
For an elliptic curve $E$ defined over the field $\mathbb{C}$ of complex numbers, we classify all translates of elliptic curves in $E^3$ such that the $x$-coordinates satisfy a linear equation. This classification enables us to establish a…
Inspired by experiments on topologically linked DNA networks, we consider the connectivity of Borromean networks, in which no two rings share a pairwise-link, but groups of three rings form inseparable triplets. Specifically, we focus on…
We classify all the relative positions between an ellipsoid and an elliptic paraboloid when the ellipsoid is small in comparison with the paraboloid ({\it small} meaning that the ellipsoid cannot be tangent to the paraboloid at two points…
This project explores the mathematical study of knots and links in topology, focusing on differentiating between the two-component Unlink and the Hopf Link using a computational tool named LINKAGE. LINKAGE employs the linking number,…
A complete treatment of the intersections of two geodesics on the surface of an ellipsoid of revolution is given. With a suitable metric for the distances between intersections, bounds are placed on their spacing. This leads to fast and…
It is increasingly common to model, simulate, and process complex materials based on loopy structures, such as in yarn-level cloth garments, which possess topological constraints between inter-looping curves. While the input model may…
Given a complex polynomial $p(z)$ of degree $n$ and an ellipse, we find an algorithm of determining the number of zeros of $p$ in the interior and exterior of the ellipse. Our results generalize the previous results of Pt\'ak and Young…
The article presents simple analysis of cones which are used to generate a given conic curve by section by a plane. It was found that if the given curve is an ellipse, then the locus of vertexes of the cones is a hyperbola. The hyperbola…
Given a rational elliptic surface X over an algebraically closed field, we investigate whether a given natural number k can be the intersection number of two sections of X. If not, we say that k a gap number. We try to answer when gap…