Calculating ellipse overlap areas

  title={Calculating ellipse overlap areas},
  author={Gary B. Hughes and Mohcine Chraibi},
  journal={Computing and Visualization in Science},
We present an approach for finding the overlap area between two ellipses that does not rely on proxy curves. The Gauss-Green formula is used to determine a segment area between two points on an ellipse. Overlap between two ellipses is calculated by combining the areas of appropriate segments and polygons in each ellipse. For four of the ten possible orientations of two ellipses, the method requires numerical determination of transverse intersection points. Approximate intersection points can be… 

Computing the Region Areas of Euler Diagrams Drawn with Three Ellipses

This paper details two novel analytic algorithms to instantaneously compute the exact region areas of three general overlapping ellipses and decomposes the region of interest into ellipse segments, while the other uses integral calculus.

Constrained Ellipse Fitting with Center on a Line

This work makes use of a constrained algebraic cost function with the incorporated “ellipse center on given line”-prior condition in a global convergent one-dimensional optimization approach and shows computational efficiency and numerical stability.

Direct Calculation of Ellipse Overlap Areas for Force- Based Models of Pedestrian Dynamics

Computer simulations based on models of pedestrian dynamics have become useful tools for evaluating emergency egress scenarios. ‘Microscopic’ models track individual pedestrian movements, which are

Numerical Calculation of Area of Elliptical Segments

In this paper, we introduce the notion of an elliptical segment as some analogy of the circular segment and we focus on the problem of calculation of its area. Based on the analytical method, we

On the Interference Problem for Ellipsoids: Experiments and Applications

This characterisation provides a new approach for exact collision detection of two moving ellipsoids since the analysis of the univariate polynomials (depending on the time) in the previously mentioned formulae provides the collision events between them.

Visualizing set relations and cardinalities using Venn and Euler diagrams

Novel automatic drawing methods for different types of Euler diagrams are presented and a user study of how such diagrams can help probabilistic judgement is studied, to facilitate data analysis and reasoning about the sets.

Lunar Crater Identification in Digital Images

This work provides the first mathematically rigorous treatment of the general crater identification problem and it is shown when it is (andWhen it is not) possible to recognize a pattern of elliptical crater rims in an image formed by perspective projection.

A New Approach to Robust Estimation of Parametric Structures

The paper presents the Multiple Input Structures with Robust Estimator (MISRE), where each structure, inlier or outlier, is processed independently, and the same two constants are used to find the scale estimates over expansions for each structure.

An Evaluation of Recent Local Image Descriptors for Real-World Applications of Image Matching

  • F. BellaviaC. Colombo
  • Computer Science
    2019 16th International Conference on Machine Vision Applications (MVA)
  • 2019
According to the evaluation results, most descriptors exhibit a gradual performance degradation in the transition from planar to non-planar scenes, and data-driven approaches are shown to have reached the matching robustness and accuracy of the best hand-crafted descriptors.

Algorithms for intersecting parametric and algebraic curves I: simple intersections

Elimination theory is used and the resultant of the equations of intersection are expressed as matrix determinant, a polynomial, which lies in the eigenvalues and eigenvectors of a numeric matrix.

Resultant-Based Methods for Plane Curves Intersection Problems

A new method to treat multiple roots is proposed, which uses generalized eigenvalues and eigenvectors of resultant matrices and describes experiments on tangential problems, which show the efficiency of the approach.

Polygon‐based contact resolution for superquadrics

The representation of discrete objects in the discrete element modelling is a fundamental issue, which has a direct impact on the efficiency of discrete element implementation and the dynamic

Polyarc discrete element for efficiently simulating arbitrarily shaped 2D particles

A new two‐dimensional discrete element type, termed the ‘polyarc’ element is presented in this paper. Compared to other discrete element types, the new element is capable of representing any

Symbolic-numeric methods for solving polynomial equations and applications

It is shown how to deduce the geometry of solutions from the structure of A and in particular, how solving polynomial equations reduces to eigenvalue and eigenvector computations of multiplication operators in A.

Asymptotic estimates for best and stepwise approximation of convex bodies II

We consider approximations of a smooth convex body by inscribed and circumscribed convex polytopes as the number of vertices, resp. facets tends to infinity. The measure of deviation used is the

Asymptotic estimates for best and stepwise approximation of convex bodies IV

In this article we first prove a stability theorem for coverings in $ by congruent solid circles: if the density of such a covering is close to its lower bound $, then most of the centers of the

Approximation of smooth convex bodies by random circumscribed polytopes

Choose n independent random points on the boundary of a convex body K ⊂Rd . The intersection of the supporting halfspaces at these random points is a random convex polyhedron. The expectations of its

Univariate Polynomials: Nearly Optimal Algorithms for Numerical Factorization and Root-finding

  • V. Pan
  • Computer Science, Mathematics
    J. Symb. Comput.
  • 2002
The new root-finder incorporates the earlier techniques of Schonhage, Neff/Reif, and Kirrinnis and the authors' old and new techniques and yields nearly optimal arithmetic and Boolean cost estimates for the computational complexity of both complete factorization and root-finding.