2012
DOI: 10.1007/s00791-013-0214-3
|View full text |Cite
|
Sign up to set email alerts
|

Calculating ellipse overlap areas

Abstract: 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 used to determine the ellipse sector area between two points, and a triangular area is added or subtracted to give the segment area. For two ellipses, overlap area is calculated by adding the areas of appropriate sectors and polygons. Intersection points for two general ellip… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
20
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 45 publications
(21 citation statements)
references
References 15 publications
0
20
0
Order By: Relevance
“…We make use of a method developed by Hughes & Chraibi (2012). Its output are the number of intersection points and the intersection area of a considered pair of ellipses.…”
Section: Association Between Gaussian Clumpsmentioning
confidence: 99%
“…We make use of a method developed by Hughes & Chraibi (2012). Its output are the number of intersection points and the intersection area of a considered pair of ellipses.…”
Section: Association Between Gaussian Clumpsmentioning
confidence: 99%
“…In order to evaluate the results of our constrained ellipse fitting approach compared to existing methods, we determine an accuracy measure which is based on the joint (overlap) area of the original underlying ellipse and the fitted ellipse [14]. The accuracy measure m depicts the similarity of the fitted ellipse with the original ellipse from a practical point of view.…”
Section: Resultsmentioning
confidence: 99%
“…Similarly, polynomial root solving is required for calculating the shortest distance between circles in R 3 or the overlap area of ellipses in R 2 , [19]. It is a well investigated problem, whose solution is crucial to many robotic applications from proximity queries, to imaging [20], and path planning [19].…”
Section: Roots Of Polynomialsmentioning
confidence: 99%