Ontology type: schema:ScholarlyArticle Open Access: True
2012-10
AUTHORSGary B. Hughes, Mohcine Chraibi
ABSTRACTWe 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. More... »
PAGES291-301
http://scigraph.springernature.com/pub.10.1007/s00791-013-0214-3
DOIhttp://dx.doi.org/10.1007/s00791-013-0214-3
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1021311985
JSON-LD is the canonical representation for SciGraph data.
TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT
[
{
"@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json",
"about": [
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/01",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Mathematical Sciences",
"type": "DefinedTerm"
},
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0101",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Pure Mathematics",
"type": "DefinedTerm"
}
],
"author": [
{
"affiliation": {
"alternateName": "California Polytechnic State University, San Luis Obispo, CA, USA",
"id": "http://www.grid.ac/institutes/grid.253547.2",
"name": [
"California Polytechnic State University, San Luis Obispo, CA, USA"
],
"type": "Organization"
},
"familyName": "Hughes",
"givenName": "Gary B.",
"id": "sg:person.016147103407.75",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016147103407.75"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Forschungszentrum J\u00fcLich, J\u00fcLich Supercomputing Centre, J\u00fclich, Germany",
"id": "http://www.grid.ac/institutes/grid.8385.6",
"name": [
"Forschungszentrum J\u00fcLich, J\u00fcLich Supercomputing Centre, J\u00fclich, Germany"
],
"type": "Organization"
},
"familyName": "Chraibi",
"givenName": "Mohcine",
"id": "sg:person.012724113050.28",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012724113050.28"
],
"type": "Person"
}
],
"citation": [
{
"id": "sg:pub.10.1007/bf01189576",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1022176841",
"https://doi.org/10.1007/bf01189576"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/3-540-27357-3_3",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1032090794",
"https://doi.org/10.1007/3-540-27357-3_3"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/11555964_7",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1000444676",
"https://doi.org/10.1007/11555964_7"
],
"type": "CreativeWork"
}
],
"datePublished": "2012-10",
"datePublishedReg": "2012-10-01",
"description": "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.",
"genre": "article",
"id": "sg:pub.10.1007/s00791-013-0214-3",
"isAccessibleForFree": true,
"isPartOf": [
{
"id": "sg:journal.1134510",
"issn": [
"1432-9360",
"1433-0369"
],
"name": "Computing and Visualization in Science",
"publisher": "Springer Nature",
"type": "Periodical"
},
{
"issueNumber": "5",
"type": "PublicationIssue"
},
{
"type": "PublicationVolume",
"volumeNumber": "15"
}
],
"keywords": [
"Gauss\u2013Green formulas",
"algebraic geometry",
"intersection points",
"companion matrix",
"eigen problem",
"ellipse equation",
"numerical determination",
"ellipse curve",
"algorithm options",
"ellipses",
"equations",
"ellipse",
"overlap area",
"possible orientations",
"point",
"alternative approach",
"geometry",
"proxy curves",
"formula",
"robustness",
"polygons",
"approach",
"matrix",
"curves",
"accuracy",
"appropriate segments",
"segment area",
"implementation",
"tool",
"orientation",
"precision",
"range",
"determination",
"area",
"segments",
"options",
"method"
],
"name": "Calculating ellipse overlap areas",
"pagination": "291-301",
"productId": [
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1021311985"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/s00791-013-0214-3"
]
}
],
"sameAs": [
"https://doi.org/10.1007/s00791-013-0214-3",
"https://app.dimensions.ai/details/publication/pub.1021311985"
],
"sdDataset": "articles",
"sdDatePublished": "2022-08-04T17:01",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-springernature-scigraph/baseset/20220804/entities/gbq_results/article/article_571.jsonl",
"type": "ScholarlyArticle",
"url": "https://doi.org/10.1007/s00791-013-0214-3"
}
]
Download the RDF metadata as: json-ld nt turtle xml License info
JSON-LD is a popular format for linked data which is fully compatible with JSON.
curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/s00791-013-0214-3'
N-Triples is a line-based linked data format ideal for batch operations.
curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/s00791-013-0214-3'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s00791-013-0214-3'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s00791-013-0214-3'
This table displays all metadata directly associated to this object as RDF triples.
116 TRIPLES
21 PREDICATES
65 URIs
54 LITERALS
6 BLANK NODES