{"id":"https://openalex.org/W3173963119","doi":"https://doi.org/10.1145/3503999","title":"Greedy and Local Search Heuristics to Build Area-Optimal Polygons","display_name":"Greedy and Local Search Heuristics to Build Area-Optimal Polygons","publication_year":2022,"publication_date":"2022-03-17","ids":{"openalex":"https://openalex.org/W3173963119","doi":"https://doi.org/10.1145/3503999","mag":"3173963119"},"language":"en","primary_location":{"id":"doi:10.1145/3503999","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3503999","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2106.14728","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083443546","display_name":"Lo\u00efc Crombez","orcid":"https://orcid.org/0000-0002-9542-5276"},"institutions":[{"id":"https://openalex.org/I198244214","display_name":"Universit\u00e9 Clermont Auvergne","ror":"https://ror.org/01a8ajp46","country_code":"FR","type":"education","lineage":["https://openalex.org/I198244214"]},{"id":"https://openalex.org/I4210099416","display_name":"Laboratoire d'Informatique, de Mod\u00e9lisation et d'Optimisation des Syst\u00e8mes","ror":"https://ror.org/00t3fpp34","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I198244214","https://openalex.org/I198244214","https://openalex.org/I203339264","https://openalex.org/I205703379","https://openalex.org/I3019848993","https://openalex.org/I4210099416","https://openalex.org/I4210123221","https://openalex.org/I4210159245","https://openalex.org/I4387154249"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Lo\u00efc Crombez","raw_affiliation_strings":["LIMOS, Universit\u00e9 Clermont Auvergne, Clermont-Fd, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIMOS, Universit\u00e9 Clermont Auvergne, Clermont-Fd, France","institution_ids":["https://openalex.org/I4210099416","https://openalex.org/I198244214"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013407008","display_name":"Guilherme D. da Fonseca","orcid":"https://orcid.org/0000-0002-9807-028X"},"institutions":[{"id":"https://openalex.org/I21491767","display_name":"Aix-Marseille Universit\u00e9","ror":"https://ror.org/035xkbk20","country_code":"FR","type":"education","lineage":["https://openalex.org/I21491767"]},{"id":"https://openalex.org/I4210114274","display_name":"Laboratoire d\u2019Informatique et Syst\u00e8mes","ror":"https://ror.org/0257sgk90","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I143002897","https://openalex.org/I21491767","https://openalex.org/I4210114274"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Guilherme D. da Fonseca","raw_affiliation_strings":["LIS, Aix-Marseille Universit\u00e9, Marseille, France"],"raw_orcid":"https://orcid.org/0000-0002-9807-028X","affiliations":[{"raw_affiliation_string":"LIS, Aix-Marseille Universit\u00e9, Marseille, France","institution_ids":["https://openalex.org/I21491767","https://openalex.org/I4210114274"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060441363","display_name":"Yan G\u00e9rard","orcid":"https://orcid.org/0000-0002-2664-0650"},"institutions":[{"id":"https://openalex.org/I198244214","display_name":"Universit\u00e9 Clermont Auvergne","ror":"https://ror.org/01a8ajp46","country_code":"FR","type":"education","lineage":["https://openalex.org/I198244214"]},{"id":"https://openalex.org/I4210099416","display_name":"Laboratoire d'Informatique, de Mod\u00e9lisation et d'Optimisation des Syst\u00e8mes","ror":"https://ror.org/00t3fpp34","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I198244214","https://openalex.org/I198244214","https://openalex.org/I203339264","https://openalex.org/I205703379","https://openalex.org/I3019848993","https://openalex.org/I4210099416","https://openalex.org/I4210123221","https://openalex.org/I4210159245","https://openalex.org/I4387154249"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Yan Gerard","raw_affiliation_strings":["LIMOS, Universit\u00e9 Clermont Auvergne, Clermont-Fd, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIMOS, Universit\u00e9 Clermont Auvergne, Clermont-Fd, France","institution_ids":["https://openalex.org/I4210099416","https://openalex.org/I198244214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0944,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.81968688,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":96},"biblio":{"volume":"27","issue":null,"first_page":"1","last_page":"11"},"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.9972000122070312,"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.9972000122070312,"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.9909999966621399,"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/T12504","display_name":"Mathematics and Applications","score":0.955299973487854,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.799321174621582},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6835981607437134},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.6643170118331909},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5811198949813843},{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.5621727705001831},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5614578723907471},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5559014678001404},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.510195255279541},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.501051664352417},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.49979090690612793},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47380369901657104},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.4656686782836914},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4576006233692169},{"id":"https://openalex.org/keywords/weight-function","display_name":"Weight function","score":0.43994683027267456},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.413796603679657},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36009979248046875},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.1383247971534729}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.799321174621582},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6835981607437134},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.6643170118331909},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5811198949813843},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.5621727705001831},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5614578723907471},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5559014678001404},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.510195255279541},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.501051664352417},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49979090690612793},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47380369901657104},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.4656686782836914},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4576006233692169},{"id":"https://openalex.org/C134466208","wikidata":"https://www.wikidata.org/wiki/Q1520657","display_name":"Weight function","level":2,"score":0.43994683027267456},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.413796603679657},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36009979248046875},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.1383247971534729},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3503999","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3503999","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2106.14728","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2106.14728","pdf_url":"https://arxiv.org/pdf/2106.14728","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:HAL:hal-03559069v1","is_oa":false,"landing_page_url":"https://hal.science/hal-03559069","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Journal of Experimental Algorithmics, 2022, 27 (2.2), pp.1-11. ⟨10.1145/3503999⟩","raw_type":"Journal articles"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2106.14728","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2106.14728","pdf_url":"https://arxiv.org/pdf/2106.14728","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W2060314446","https://openalex.org/W2338207953","https://openalex.org/W2982209274","https://openalex.org/W3212800592","https://openalex.org/W4298410530"],"related_works":["https://openalex.org/W2608536130","https://openalex.org/W2102467404","https://openalex.org/W2987051945","https://openalex.org/W53644101","https://openalex.org/W2154329468","https://openalex.org/W4296464845","https://openalex.org/W2389833224","https://openalex.org/W2372903818","https://openalex.org/W1567510565","https://openalex.org/W2896729805"],"abstract_inverted_index":{"In":[0],"this":[1],"article,":[2],"we":[3],"present":[4],"our":[5],"heuristic":[6,41],"solutions":[7,26,64],"to":[8,54,61,99,116],"the":[9,13,66,81,103,109,118],"problems":[10],"of":[11,23,68,83,95],"finding":[12],"maximum":[14],"and":[15,36,47],"minimum":[16],"area":[17],"polygons":[18],"with":[19,43],"a":[20,44,55],"given":[21],"set":[22],"vertices.":[24],"Our":[25],"are":[27,114],"based":[28],"mostly":[29],"on":[30],"two":[31],"simple":[32,45],"algorithmic":[33],"paradigms:":[34],"greedy":[35,40],"local":[37,91],"search.":[38],"The":[39,90],"starts":[42],"polygon":[46],"adds":[48],"vertices":[49,98],"one":[50],"by":[51],"one,":[52],"according":[53],"weight":[56,71],"function.":[57],"A":[58],"crucial":[59],"ingredient":[60],"obtain":[62],"good":[63],"is":[65],"choice":[67],"an":[69],"appropriate":[70],"function":[72],"that":[73,113],"avoids":[74],"long":[75,78],"edges,":[76],"since":[77],"edges":[79,87],"impede":[80],"insertion":[82],"too":[84],"many":[85],"different":[86,110],"later":[88],"on.":[89],"search":[92],"part":[93],"consists":[94],"moving":[96],"consecutive":[97],"another":[100],"location":[101],"in":[102],"polygonal":[104],"chain.":[105],"We":[106],"also":[107],"discuss":[108],"implementation":[111],"techniques":[112],"necessary":[115],"reduce":[117],"running":[119],"time.":[120]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}