{"id":"https://openalex.org/W2167623422","doi":"https://doi.org/10.1016/0020-0190(91)90030-l","title":"A simple algorithm for computing the smallest enclosing circle","display_name":"A simple algorithm for computing the smallest enclosing circle","publication_year":1991,"publication_date":"1991-02-01","ids":{"openalex":"https://openalex.org/W2167623422","doi":"https://doi.org/10.1016/0020-0190(91)90030-l","mag":"2167623422"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(91)90030-l","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(91)90030-l","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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/A5017408163","display_name":"Sven Skyum","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Sven Skyum","raw_affiliation_strings":["Computer Science Department, Aarhus University, Ny Munkegade, Bldg. 540, DK-800 Aarhus C, Denmark"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Aarhus University, Ny Munkegade, Bldg. 540, DK-800 Aarhus C, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5017408163"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":1.0034,"has_fulltext":false,"cited_by_count":97,"citation_normalized_percentile":{"value":0.75905644,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"37","issue":"3","first_page":"121","last_page":"125"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":1.0,"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":1.0,"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9932000041007996,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11164","display_name":"Remote Sensing and LiDAR Applications","score":0.9923999905586243,"subfield":{"id":"https://openalex.org/subfields/2305","display_name":"Environmental Engineering"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.7397133708000183},{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.7233411073684692},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.6851435303688049},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.6679297089576721},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.6162921786308289},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.6071276068687439},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6013432145118713},{"id":"https://openalex.org/keywords/convex-polygon","display_name":"Convex polygon","score":0.5915693044662476},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.568045437335968},{"id":"https://openalex.org/keywords/polygon-covering","display_name":"Polygon covering","score":0.5473074316978455},{"id":"https://openalex.org/keywords/simple-algorithm","display_name":"SIMPLE algorithm","score":0.5395519137382507},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4738785922527313},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.46808868646621704},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3880979120731354},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.15633758902549744}],"concepts":[{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.7397133708000183},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.7233411073684692},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.6851435303688049},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6679297089576721},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.6162921786308289},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.6071276068687439},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6013432145118713},{"id":"https://openalex.org/C2780034980","wikidata":"https://www.wikidata.org/wiki/Q3259505","display_name":"Convex polygon","level":3,"score":0.5915693044662476},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.568045437335968},{"id":"https://openalex.org/C187778580","wikidata":"https://www.wikidata.org/wiki/Q18389289","display_name":"Polygon covering","level":3,"score":0.5473074316978455},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.5395519137382507},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4738785922527313},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.46808868646621704},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3880979120731354},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.15633758902549744},{"id":"https://openalex.org/C97355855","wikidata":"https://www.wikidata.org/wiki/Q11473","display_name":"Thermodynamics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/0020-0190(91)90030-l","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(91)90030-l","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/f91e0b0d-9afc-42ed-baed-325132c728ff","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/f91e0b0d-9afc-42ed-baed-325132c728ff","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Skyum, S 1991, 'A simple algorithm for computing the smallest enclosing circle', Information Processing Letters, vol. 37, no. 3, pp. 121-125. https://doi.org/10.1016/0020-0190(91)90030-L","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W2005314985","https://openalex.org/W2025299767","https://openalex.org/W2052393177","https://openalex.org/W2074863496","https://openalex.org/W2107423006","https://openalex.org/W2139594840","https://openalex.org/W3041834803"],"related_works":["https://openalex.org/W2997571660","https://openalex.org/W2980991945","https://openalex.org/W4288091041","https://openalex.org/W2165083794","https://openalex.org/W3036994771","https://openalex.org/W1579553590","https://openalex.org/W2004395316","https://openalex.org/W2913852997","https://openalex.org/W1963624385","https://openalex.org/W2167623422"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-20T07:46:08.049788","created_date":"2025-10-10T00:00:00"}