{"id":"https://openalex.org/W2017260899","doi":"https://doi.org/10.1016/0196-6774(85)90039-2","title":"Computing the extreme distances between two convex polygons","display_name":"Computing the extreme distances between two convex polygons","publication_year":1985,"publication_date":"1985-06-01","ids":{"openalex":"https://openalex.org/W2017260899","doi":"https://doi.org/10.1016/0196-6774(85)90039-2","mag":"2017260899"},"language":"en","primary_location":{"id":"doi:10.1016/0196-6774(85)90039-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0196-6774(85)90039-2","pdf_url":null,"source":{"id":"https://openalex.org/S110520077","display_name":"Journal of Algorithms","issn_l":"0196-6774","issn":["0196-6774","1090-2678"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319955","host_organization_name":"Academic Press","host_organization_lineage":["https://openalex.org/P4310319955","https://openalex.org/P4310320990"],"host_organization_lineage_names":["Academic Press","Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069999967","display_name":"Herbert Edelsbrunner","orcid":"https://orcid.org/0000-0002-9823-6833"},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]},{"id":"https://openalex.org/I15766117","display_name":"University of Graz","ror":"https://ror.org/01faaaf77","country_code":"AT","type":"education","lineage":["https://openalex.org/I15766117"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"H Edelsbrunner","raw_affiliation_strings":["Institutes for Information Processing, Technical University of Graz, Schiesstattgasse 4a, A-8010 Graz, Austria","University of Graz, Graz, Austria"],"affiliations":[{"raw_affiliation_string":"Institutes for Information Processing, Technical University of Graz, Schiesstattgasse 4a, A-8010 Graz, Austria","institution_ids":["https://openalex.org/I4092182"]},{"raw_affiliation_string":"University of Graz, Graz, Austria","institution_ids":["https://openalex.org/I15766117"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5069999967"],"corresponding_institution_ids":["https://openalex.org/I15766117","https://openalex.org/I4092182"],"apc_list":null,"apc_paid":null,"fwci":4.2419,"has_fulltext":false,"cited_by_count":122,"citation_normalized_percentile":{"value":0.9294964,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"6","issue":"2","first_page":"213","last_page":"224"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9930999875068665,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11245","display_name":"Advanced Numerical Analysis Techniques","score":0.9603000283241272,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8556740283966064},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.7416602969169617},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7235033512115479},{"id":"https://openalex.org/keywords/convex-polygon","display_name":"Convex polygon","score":0.7119637131690979},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.6554486751556396},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6183438897132874},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.522834837436676},{"id":"https://openalex.org/keywords/extreme-point","display_name":"Extreme point","score":0.5217243432998657},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.4181939959526062},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1713663637638092},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09641417860984802},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.0602339506149292}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8556740283966064},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.7416602969169617},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7235033512115479},{"id":"https://openalex.org/C2780034980","wikidata":"https://www.wikidata.org/wiki/Q3259505","display_name":"Convex polygon","level":3,"score":0.7119637131690979},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.6554486751556396},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6183438897132874},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.522834837436676},{"id":"https://openalex.org/C39847760","wikidata":"https://www.wikidata.org/wiki/Q1385465","display_name":"Extreme point","level":2,"score":0.5217243432998657},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.4181939959526062},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1713663637638092},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09641417860984802},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0602339506149292},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0196-6774(85)90039-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0196-6774(85)90039-2","pdf_url":null,"source":{"id":"https://openalex.org/S110520077","display_name":"Journal of Algorithms","issn_l":"0196-6774","issn":["0196-6774","1090-2678"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319955","host_organization_name":"Academic Press","host_organization_lineage":["https://openalex.org/P4310319955","https://openalex.org/P4310320990"],"host_organization_lineage_names":["Academic Press","Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1561564976","https://openalex.org/W2008745553","https://openalex.org/W2028641691","https://openalex.org/W2056531186","https://openalex.org/W2074815218","https://openalex.org/W2124310283","https://openalex.org/W2294603245","https://openalex.org/W6633692659","https://openalex.org/W6652512888","https://openalex.org/W6697119891"],"related_works":["https://openalex.org/W2053943947","https://openalex.org/W4240339429","https://openalex.org/W2154141401","https://openalex.org/W2314484939","https://openalex.org/W2283666161","https://openalex.org/W2091897099","https://openalex.org/W1835505183","https://openalex.org/W2009935692","https://openalex.org/W1585992543","https://openalex.org/W2215744270"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}