{"id":"https://openalex.org/W2114490261","doi":"https://doi.org/10.1142/s0218195900000267","title":"EFFICIENT APPROXIMATION OF CONVEX POLYGONS","display_name":"EFFICIENT APPROXIMATION OF CONVEX POLYGONS","publication_year":2000,"publication_date":"2000-10-01","ids":{"openalex":"https://openalex.org/W2114490261","doi":"https://doi.org/10.1142/s0218195900000267","mag":"2114490261"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195900000267","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195900000267","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","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/A5015621968","display_name":"Mario A. L\u00f3pez","orcid":"https://orcid.org/0000-0002-1861-0603"},"institutions":[{"id":"https://openalex.org/I131651094","display_name":"University of Denver","ror":"https://ror.org/04w7skc03","country_code":"US","type":"education","lineage":["https://openalex.org/I131651094"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"MARIO A. LOPEZ","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Denver, Denver, Colorado 80208, U.S.A"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Denver, Denver, Colorado 80208, U.S.A","institution_ids":["https://openalex.org/I131651094"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108509587","display_name":"Shlomo Reisner","orcid":null},"institutions":[{"id":"https://openalex.org/I91203450","display_name":"University of Haifa","ror":"https://ror.org/02f009v59","country_code":"IL","type":"education","lineage":["https://openalex.org/I91203450"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"SHLOMO REISNER","raw_affiliation_strings":["Department of Mathematics, University of Haifa, Haifa, 31905, Israel","Department of Mathematics, University of Haifa, Haifa 31905, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Haifa, Haifa, 31905, Israel","institution_ids":["https://openalex.org/I91203450"]},{"raw_affiliation_string":"Department of Mathematics, University of Haifa, Haifa 31905, Israel","institution_ids":["https://openalex.org/I91203450"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5015621968"],"corresponding_institution_ids":["https://openalex.org/I131651094"],"apc_list":null,"apc_paid":null,"fwci":0.7821,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.78305709,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"10","issue":"05","first_page":"445","last_page":"452"},"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.9998999834060669,"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.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9991999864578247,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/convex-polygon","display_name":"Convex polygon","score":0.7385578751564026},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.7183109521865845},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.629965603351593},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.6191310882568359},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6000052690505981},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5689750909805298},{"id":"https://openalex.org/keywords/convex-combination","display_name":"Convex combination","score":0.46210914850234985},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4362741708755493},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3371884226799011},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3288966417312622},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.27820566296577454},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.27543795108795166},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07717910408973694}],"concepts":[{"id":"https://openalex.org/C2780034980","wikidata":"https://www.wikidata.org/wiki/Q3259505","display_name":"Convex polygon","level":3,"score":0.7385578751564026},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.7183109521865845},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.629965603351593},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.6191310882568359},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6000052690505981},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5689750909805298},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.46210914850234985},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4362741708755493},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3371884226799011},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3288966417312622},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.27820566296577454},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27543795108795166},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07717910408973694},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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":1,"locations":[{"id":"doi:10.1142/s0218195900000267","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195900000267","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","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":12,"referenced_works":["https://openalex.org/W1607203414","https://openalex.org/W1964410971","https://openalex.org/W1993553426","https://openalex.org/W1996940760","https://openalex.org/W2021160897","https://openalex.org/W2038184042","https://openalex.org/W2040178277","https://openalex.org/W2052562833","https://openalex.org/W2069047468","https://openalex.org/W2083000433","https://openalex.org/W2084642194","https://openalex.org/W2097669873"],"related_works":["https://openalex.org/W1976378994","https://openalex.org/W2179864577","https://openalex.org/W2125658617","https://openalex.org/W2524980673","https://openalex.org/W1797266394","https://openalex.org/W2162070658","https://openalex.org/W2013218978","https://openalex.org/W87746870","https://openalex.org/W2126612915","https://openalex.org/W2170103551","https://openalex.org/W2908270252","https://openalex.org/W2170293258","https://openalex.org/W2037134555","https://openalex.org/W1568927643","https://openalex.org/W1560502031","https://openalex.org/W1979511537","https://openalex.org/W3163537424","https://openalex.org/W2909142822","https://openalex.org/W2004389974","https://openalex.org/W2624715771"],"abstract_inverted_index":{"We":[0],"present":[1],"algorithms":[2,23],"for":[3,53],"the":[4,19,38,49,68,71],"approximation":[5,72],"of":[6,40,48,70,74],"a":[7,11,54,62],"convex":[8,12],"n-gon":[9],"by":[10,65],"k-gon":[13],"(k<n)":[14],"which":[15],"inscribes":[16],"or":[17],"circumscribes":[18],"original":[20],"polygon.":[21],"Our":[22],"run":[24],"in":[25,37],"O(n+(n-k)":[26],"log":[27],"n)":[28],"time":[29],"and":[30,44,76],"are":[31],"easy":[32],"to":[33,46],"implement.":[34],"Their":[35],"accuracy,":[36],"sense":[39],"area-difference,":[41],"is":[42],"analyzed":[43],"shown":[45],"be":[47],"best":[50],"order":[51],"possible":[52],"general":[55],"algorithm.":[56],"In":[57],"particular,":[58],"this":[59],"analysis":[60],"settles":[61],"question":[63],"raised":[64],"O'Rourke":[66],"on":[67],"performance":[69],"algorithm":[73],"Dori":[75],"Ben-Bassat.":[77]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}