001 | 151346 | ||
005 | 20210129213449.0 | ||
024 | 7 | _ | |a 10.1007/s00791-013-0214-3 |2 doi |
024 | 7 | _ | |a 1433-0369 |2 ISSN |
024 | 7 | _ | |a 1432-9360 |2 ISSN |
037 | _ | _ | |a FZJ-2014-01319 |
082 | _ | _ | |a 570 |
100 | 1 | _ | |a Hughes, Gary B. |0 P:(DE-HGF)0 |b 0 |e Corresponding author |
245 | _ | _ | |a Calculating ellipse overlap areas |
260 | _ | _ | |a Berlin |c 2012 |b Springer |
336 | 7 | _ | |a Journal Article |b journal |m journal |0 PUB:(DE-HGF)16 |s 1392719695_30879 |2 PUB:(DE-HGF) |
336 | 7 | _ | |a Output Types/Journal article |2 DataCite |
336 | 7 | _ | |a Journal Article |0 0 |2 EndNote |
336 | 7 | _ | |a ARTICLE |2 BibTeX |
336 | 7 | _ | |a JOURNAL_ARTICLE |2 ORCID |
336 | 7 | _ | |a article |2 DRIVER |
520 | _ | _ | |a 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 determined by solving the two implicit ellipse equations simultaneously. Alternative approaches for finding transverse intersection points are available using tools from algebraic geometry, e.g., based on solving an Eigen-problem that is related to companion matrices of the two implicit ellipse curves. Implementations in C of several algorithm options are analyzed for accuracy, precision and robustness with a range of input ellipses. |
536 | _ | _ | |a 411 - Computational Science and Mathematical Methods (POF2-411) |0 G:(DE-HGF)POF2-411 |c POF2-411 |x 0 |f POF II |
588 | _ | _ | |a Dataset connected to CrossRef, juser.fz-juelich.de |
700 | 1 | _ | |a Chraibi, Mohcine |0 P:(DE-Juel1)132077 |b 1 |u fzj |
773 | _ | _ | |a 10.1007/s00791-013-0214-3 |g Vol. 15, no. 5, p. 291 - 301 |p 291 - 301 |n 5 |0 PERI:(DE-600)1458972-2 |t Computing and visualization in science |v 15 |y 2012 |x 1433-0369 |
856 | 4 | _ | |u https://juser.fz-juelich.de/record/151346/files/FZJ-2014-01319.pdf |z Published final document. |y Restricted |
909 | C | O | |o oai:juser.fz-juelich.de:151346 |p VDB |
910 | 1 | _ | |a Forschungszentrum Jülich GmbH |0 I:(DE-588b)5008462-8 |k FZJ |b 1 |6 P:(DE-Juel1)132077 |
913 | 2 | _ | |a DE-HGF |b Key Technologies |l Supercomputing & Big Data |1 G:(DE-HGF)POF3-510 |0 G:(DE-HGF)POF3-511 |2 G:(DE-HGF)POF3-500 |v Computational Science and Mathematical Methods |x 0 |
913 | 1 | _ | |a DE-HGF |b Schlüsseltechnologien |l Supercomputing |1 G:(DE-HGF)POF2-410 |0 G:(DE-HGF)POF2-411 |2 G:(DE-HGF)POF2-400 |v Computational Science and Mathematical Methods |x 0 |4 G:(DE-HGF)POF |3 G:(DE-HGF)POF2 |
914 | 1 | _ | |y 2013 |
915 | _ | _ | |a No Peer Review |0 StatID:(DE-HGF)0020 |2 StatID |
915 | _ | _ | |a DBCoverage |0 StatID:(DE-HGF)0200 |2 StatID |b SCOPUS |
915 | _ | _ | |a Nationallizenz |0 StatID:(DE-HGF)0420 |2 StatID |
920 | 1 | _ | |0 I:(DE-Juel1)JSC-20090406 |k JSC |l Jülich Supercomputing Center |x 0 |
980 | _ | _ | |a journal |
980 | _ | _ | |a VDB |
980 | _ | _ | |a UNRESTRICTED |
980 | _ | _ | |a I:(DE-Juel1)JSC-20090406 |
Library | Collection | CLSMajor | CLSMinor | Language | Author |
---|