Related papers: Calculating ellipse overlap areas
Algorithms for the computation of the forward and inverse geodesic problems for an ellipsoid of revolution are derived. These are accurate to better than 15 nm when applied to the terrestrial ellipsoids. The solutions of other problems…
In this work we present a new simple but efficient scheme - Subsquares approach - for development of algorithms for enclosing the solution set of overdetermined interval linear systems. We are going to show two algorithms based on this…
Using equivariant geometry, we find a universal formula that computes the number of times a general cubic surface arises in a family. As applications, we show that the PGL(4) orbit closure of a generic cubic surface has degree 96120, and…
We develop the notion of $g$-angle between two subspaces of a normed space. In particular, we discuss the $g$-angle between a $1$-dimensional subspace and a $t$-dimensional subspace for $t\geq 1$ and the $g$-angle between a $2$-dimensional…
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…
Elliptic partial differential equations are important both from application and analysis points of views. In this paper we apply the Closest Point Method to solving elliptic equations on general curved surfaces. Based on the closest point…
The object of this paper is to transform a set of local chain complexes to a single global complex using an equivalence relation of congruence of cells, solving topologically the numerical inaccuracies of floating-point arithmetics. While…
An elementary, albeit higher dimensional, argument is used to compute the area under the power function curve between 0 and 1.
Merge trees are fundamental structures in topological data analysis. Interleaving distance is a widely accepted metric for comparing merge trees, with applications in visualization and scientific computing. While a greedy algorithm exists…
This is a sequel of our previous paper where we described an algorithm to find a solution of differential equations for master integrals in the form of an $\epsilon$-expansion series with numerical coefficients. The algorithm is based on…
In the paper, we investigate Two Sets Intersection problem. Assume that we have two sets that are subsets of n objects. Sets are presented by two predicates that show which of n objects belong to these sets. We present a quantum algorithm…
Polygon inclusion problems have been studied extensively in geometric optimization. In this paper, we consider the variant of computing the maximum area parallelograms (MAPs) and all the locally maximal area parallelograms (LMAPs) in a…
Given a finite set of non-collinear points in the plane, there exists a line that passes through exactly two points. Such a line is called an ordinary line. An efficient algorithm for computing such a line was proposed by Mukhopadhyay et…
We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…
A generalization of the Kontsevich Airy-model allows one to compute the intersection numbers of the moduli space of p-spin curves. These models are deduced from averages of characteristic polynomials over Gaussian ensembles of random…
In a recent paper [{\em F. Bernal, J. Mor\'on-Vidal and J.A. Acebr\'on, Comp.$\&$ Math. App. 146:294-308 (2023)}] an hybrid supercomputing algorithm for elliptic equations has been put forward. The idea is that the interfacial nodal…
We propose a multiscale method for elliptic problems on complex domains, e.g. domains with cracks or complicated boundary. For local singularities this paper also offers a discrete alternative to enrichment techniques such as XFEM. We…
In this paper, the intersection of bivariate orthogonal polynomials on triangle patches will be investigated. The result is interesting by its own but also has important applications in the theory of a posteriori error estimation for finite…
In this paper I will consider many of the various definitions of the overlap and of its probability distribution that have been introduced in the literature starting from the original papers of Edwards and Anderson; I will present also some…
In this paper the problem of maximizing the distance to a given fixed point over an intersection of balls is considered. It is known that this problem is NP complete in the general case, since any subset sum problem can be solved upon…