Related papers: Calculating ellipse overlap areas
In this paper, we propose an efficient clustering technique to solve the problem of clustering in the presence of obstacles. The proposed algorithm divides the spatial area into rectangular cells. Each cell is associated with statistical…
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…
If a line cuts randomly two sides of a triangle, the length of the segment determined by the points of intersection is also random. The object of this study, applied to a particular case, is to calculate the probability that the length of…
We compute the (three) master integrals for the crossed ladder diagram with two exchanged quanta of equal mass. The differential equations obeyed by the master integrals are used to generate power series expansions centered around all the…
An algorithm is demonstrated that finds an ordinary intersection in an arrangement of $n$ lines in $\mathbb{R}^2$, not all parallel and not all passing through a common point, in time $O(n \log{n})$. The algorithm is then extended to find…
Three linearly dependent and pairwise linearly independent vectors of an euclidian space uniquely determine a planar quadric with symmetry centre in the origin. A rather simple formula for the area of an arbitrary sector at centre of such a…
A fundamental problem in shape matching and geometric similarity is computing the maximum area overlap between two polygons under translation. For general simple polygons, the best-known algorithm runs in $O((nm)^2 \log(nm))$ time [Mount,…
We introduce an algebraic multiscale method for two--dimensional problems. The method uses the generalized multiscale finite element method based on the quadrilateral nonconforming finite element spaces. Differently from the…
In this work we study the interleaving distance between merge trees from a combinatorial point of view. We use a particular type of matching between trees to obtain a novel formulation of the distance. With such formulation, we tackle the…
This paper studies the problem of enumerating all maximal collinear subsets of size at least three in a given set of $n$ points. An algorithm for this problem, besides solving degeneracy testing and the exact fitting problem, can also help…
Fitting concentric geometric objects to digitized data is an important problem in many areas such as iris detection, autonomous navigation, and industrial robotics operations. There are two common approaches to fitting geometric shapes to…
Starting from the well-known and elementary problem of inscribing the rectangle of the greatest area in an ellipse, we look at possible, gradually more and more complicated variants of this problem. Our goal is to demonstrate to an average…
A set of n segments in the plane may form a Euclidean TSP tour, a tree, or a matching, among others. Optimal TSP tours as well as minimum spanning trees and perfect matchings have no crossing segments, but several heuristics and…
This paper gives a detailed derivation of the surface of a tri-axial ellipsoid. The general result is in terms of the elliptic integrals of the first and second kind. It is in checked for all special cases included and the corresponding…
It is well known that Heron's theorem provides an explicit formula for the area of a triangle, as a symmetric function of the lengths of its sides. It has been extended by Brahmagupta to quadrilaterals inscribed in a circle (cyclic…
We present an algorithm to compute the minimum orbital intersection distance (MOID), or global minimum of the distance between the points lying on two Keplerian ellipses. This is achieved by finding all stationary points of the distance…
A rectangular layout $\mathcal{L}$ is a rectangle partitioned into disjoint smaller rectangles so that no four smaller rectangles meet at the same point. Rectangular layouts were originally used as floorplans in VLSI design to represent…
We propose a flexible class of estimates for "common change in the mean" sets in spatio-temporal data. We rely on a scan type approach by subdividing the spatial observations into suitable overlapping regions to which classical CUSUM…
Finding an exact maximum distance of two points in the given set is a fundamental computational problem which is solved in many applications. This paper presents a fast, simple to implement and robust algorithm for finding this maximum…
If E is any ellipse inscribed in a convex quadrilateral, D, then we prove that Area(E)/Area(D) is less than or equal to pi/4, and equality holds if and only if D is a parallelogram and E is tangent to the sides of D at the midpoints. This…