{"id":"https://openalex.org/W3212913259","doi":"https://doi.org/10.1145/3504000","title":"Area-Optimal Simple Polygonalizations: The CG Challenge 2019","display_name":"Area-Optimal Simple Polygonalizations: The CG Challenge 2019","publication_year":2022,"publication_date":"2022-03-04","ids":{"openalex":"https://openalex.org/W3212913259","doi":"https://doi.org/10.1145/3504000","mag":"3212913259"},"language":"en","primary_location":{"id":"doi:10.1145/3504000","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3504000","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3504000","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3504000","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083684609","display_name":"Erik D. Demaine","orcid":"https://orcid.org/0000-0003-3803-5703"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Erik D. Demaine","raw_affiliation_strings":["CSAIL, MIT, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CSAIL, MIT, Cambridge, MA, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015542807","display_name":"S\u00e1ndor P. Fekete","orcid":"https://orcid.org/0000-0002-9062-4241"},"institutions":[{"id":"https://openalex.org/I94509681","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66","country_code":"DE","type":"education","lineage":["https://openalex.org/I94509681"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"S\u00e1ndor P. Fekete","raw_affiliation_strings":["Department of Computer Science, TU Braunschweig, Braunschweig, Germany"],"raw_orcid":"https://orcid.org/0000-0002-9062-4241","affiliations":[{"raw_affiliation_string":"Department of Computer Science, TU Braunschweig, Braunschweig, Germany","institution_ids":["https://openalex.org/I94509681"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076288432","display_name":"Phillip Keldenich","orcid":"https://orcid.org/0000-0002-6677-5090"},"institutions":[{"id":"https://openalex.org/I94509681","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66","country_code":"DE","type":"education","lineage":["https://openalex.org/I94509681"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Phillip Keldenich","raw_affiliation_strings":["Department of Computer Science, TU Braunschweig, Braunschweig, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, TU Braunschweig, Braunschweig, Germany","institution_ids":["https://openalex.org/I94509681"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073066645","display_name":"Dominik Krupke","orcid":"https://orcid.org/0000-0003-1573-3496"},"institutions":[{"id":"https://openalex.org/I94509681","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66","country_code":"DE","type":"education","lineage":["https://openalex.org/I94509681"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Dominik Krupke","raw_affiliation_strings":["Department of Computer Science, TU Braunschweig, Braunschweig, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, TU Braunschweig, Braunschweig, Germany","institution_ids":["https://openalex.org/I94509681"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015247956","display_name":"Joseph S. B. Mitchell","orcid":"https://orcid.org/0000-0002-0152-2279"},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Joseph S. B. Mitchell","raw_affiliation_strings":["Department of Applied Mathematics and Statistics, Stony Brook University, Stony Brook, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics and Statistics, Stony Brook University, Stony Brook, NY, USA","institution_ids":["https://openalex.org/I59553526"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.62,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.92941176,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"27","issue":null,"first_page":"1","last_page":"12"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12698","display_name":"3D Modeling in Geospatial Applications","score":0.9923999905586243,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/simple","display_name":"Simple (philosophy)","score":0.8427712917327881},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.7230398654937744},{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.674666166305542},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.601840615272522},{"id":"https://openalex.org/keywords/ranging","display_name":"Ranging","score":0.5733177661895752},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.5111384987831116},{"id":"https://openalex.org/keywords/subject","display_name":"Subject (documents)","score":0.4892125129699707},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4787444472312927},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44076991081237793},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42806410789489746},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4075309634208679},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.3689078092575073},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35044071078300476},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.2053133249282837}],"concepts":[{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.8427712917327881},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.7230398654937744},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.674666166305542},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.601840615272522},{"id":"https://openalex.org/C115051666","wikidata":"https://www.wikidata.org/wiki/Q6522493","display_name":"Ranging","level":2,"score":0.5733177661895752},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.5111384987831116},{"id":"https://openalex.org/C2777855551","wikidata":"https://www.wikidata.org/wiki/Q12310021","display_name":"Subject (documents)","level":2,"score":0.4892125129699707},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4787444472312927},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44076991081237793},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42806410789489746},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4075309634208679},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.3689078092575073},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35044071078300476},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.2053133249282837},{"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/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0},{"id":"https://openalex.org/C161191863","wikidata":"https://www.wikidata.org/wiki/Q199655","display_name":"Library science","level":1,"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3504000","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3504000","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3504000","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3504000","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3504000","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3504000","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G54751696","display_name":"AF:  Small:  Approximation Algorithms for Geometric Network Optimization","funder_award_id":"1526406","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G949854251","display_name":"AF:Small:Geometric Optimization Problems for Routing, Searching, and Coverage in the Face of Uncertainty","funder_award_id":"2007275","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"},{"id":"https://openalex.org/F4320338291","display_name":"Sandia National Laboratories","ror":"https://ror.org/01apwpt12"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3212913259.pdf","grobid_xml":"https://content.openalex.org/works/W3212913259.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W16939786","https://openalex.org/W80704544","https://openalex.org/W134695598","https://openalex.org/W1557760894","https://openalex.org/W1570631982","https://openalex.org/W1988912457","https://openalex.org/W1991348837","https://openalex.org/W2026745357","https://openalex.org/W2038902093","https://openalex.org/W2048699157","https://openalex.org/W2060314446","https://openalex.org/W2064022936","https://openalex.org/W2084143237","https://openalex.org/W2088397521","https://openalex.org/W2163428398","https://openalex.org/W2163448076","https://openalex.org/W2325441818","https://openalex.org/W2326738635","https://openalex.org/W2331100660","https://openalex.org/W2338207953","https://openalex.org/W2569928643","https://openalex.org/W2760814065","https://openalex.org/W2952683736","https://openalex.org/W2982209274","https://openalex.org/W3173963119","https://openalex.org/W3212800592","https://openalex.org/W4214829407","https://openalex.org/W4220863407","https://openalex.org/W4235375376","https://openalex.org/W4252017042","https://openalex.org/W4281481719","https://openalex.org/W4296785232","https://openalex.org/W4321461825","https://openalex.org/W6698381673"],"related_works":["https://openalex.org/W2102467404","https://openalex.org/W2608536130","https://openalex.org/W3014595637","https://openalex.org/W2987051945","https://openalex.org/W2154329468","https://openalex.org/W4296464845","https://openalex.org/W2389833224","https://openalex.org/W53644101","https://openalex.org/W2372903818","https://openalex.org/W1567510565"],"abstract_inverted_index":{"We":[0],"give":[1],"an":[2],"overview":[3],"of":[4,9,14,40,50],"theoretical":[5],"and":[6,36],"practical":[7],"aspects":[8],"finding":[10,51],"a":[11,23],"simple":[12],"polygon":[13],"minimum":[15],"(Min-Area)":[16],"or":[17],"maximum":[18],"(Max-Area)":[19],"possible":[20],"area":[21],"for":[22],"given":[24],"set":[25],"ofnpoints":[26],"in":[27],"the":[28,38,41,48,63],"plane.":[29],"Both":[30],"problems":[31],"are":[32],"known":[33],"to":[34,54],"beNP-hard":[35],"were":[37],"subject":[39],"2019":[42],"Computational":[43],"Geometry":[44],"Challenge,":[45],"which":[46],"presented":[47],"quest":[49],"good":[52],"solutions":[53],"more":[55],"than":[56],"200":[57],"instances,":[58],"ranging":[59],"fromn=":[60],"10":[61],"all":[62],"way":[64],"ton=":[65],"1,":[66],"000,":[67],"000.":[68]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":6}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}