乐胖代购免代理版

{"id":"https://openalex.org/W4214829407","doi":"https://doi.org/10.1145/3500911","title":"Area Optimal Polygonization Using Simulated Annealing","display_name":"Area Optimal Polygonization Using Simulated Annealing","publication_year":2022,"publication_date":"2022-03-04","ids":{"openalex":"https://openalex.org/W4214829407","doi":"https://doi.org/10.1145/3500911"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1145/3500911","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_indexed_in_scopus":true,"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":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5069722256","display_name":"Nir Goren","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"funder","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Nir Goren","raw_affiliation_strings":["The Blavatnik School of Computer Science, Tel Aviv University, Tel Aviv, Israel"],"affiliations":[{"raw_affiliation_string":"The Blavatnik School of Computer Science, Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043776677","display_name":"Efi Fogel","orcid":"https://orcid.org/0000-0001-7228-8806"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"funder","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Efi Fogel","raw_affiliation_strings":["The Blavatnik School of Computer Science, Tel Aviv University, Tel Aviv, Israel"],"affiliations":[{"raw_affiliation_string":"The Blavatnik School of Computer Science, Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038503253","display_name":"Dan Halperin","orcid":"https://orcid.org/0000-0002-3345-3765"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"funder","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Dan Halperin","raw_affiliation_strings":["The Blavatnik School of Computer Science, Tel Aviv University, Tel Aviv, Israel"],"affiliations":[{"raw_affiliation_string":"The Blavatnik School of Computer Science, Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.943,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.798136,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":90},"biblio":{"volume":"27","issue":null,"first_page":"1","last_page":"17"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9992,"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.9992,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9913,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9894,"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/polygon","display_name":"Polygon (computer graphics)","score":0.690449},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.45836908}],"concepts":[{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.8520707},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.690449},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.64103866},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.62254536},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.57086945},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5200479},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.49118516},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4797341},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.4677724},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.45836908},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.44160482},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2885789},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.07133448},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1145/3500911","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_indexed_in_scopus":true,"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":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[{"funder":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation","award_id":"1736/19"}],"datasets":[],"versions":[],"referenced_works_count":10,"referenced_works":["https://openalex.org/W1480923476","https://openalex.org/W2024060531","https://openalex.org/W2044118667","https://openalex.org/W2056760934","https://openalex.org/W2060314446","https://openalex.org/W2148948822","https://openalex.org/W2569928643","https://openalex.org/W4251391716","https://openalex.org/W4298410530","https://openalex.org/W4306904253"],"related_works":["https://openalex.org/W4315798097","https://openalex.org/W4308609420","https://openalex.org/W4214829407","https://openalex.org/W3014595637","https://openalex.org/W3012852983","https://openalex.org/W2619386716","https://openalex.org/W2170293258","https://openalex.org/W2053571861","https://openalex.org/W1967086241","https://openalex.org/W1939200287"],"abstract_inverted_index":{"We":[0,75,94],"describe":[1],"a":[2,16,29,55,87,126],"practical":[3],"method":[4,52],"to":[5,27,109,130],"find":[6,28],"near-optimal":[7],"solutions":[8],"for":[9],"the":[10,22,24,46,97,103,112,117,122],"area-optimal":[11],"simple":[12,30],"polygonization":[13],"problem:":[14],"Given":[15],"set":[17],"of":[18,32,54,58,106,121,128],"points":[19],"S":[20,39],"in":[21,66],"plane,":[23],"objective":[25],"is":[26,43],"polygon":[31,88],"minimum":[33],"or":[34],"maximum":[35],"area":[36],"defined":[37],"by":[38],".":[40],"Our":[41],"approach":[42],"based":[44],"on":[45,119],"celebrated":[47],"metaheuristic":[48],"Simulated":[49],"Annealing.":[50],"The":[51],"consists":[53],"modular":[56],"pipeline":[57],"steps,":[59],"where":[60],"each":[61,107,120],"step":[62],"can":[63],"be":[64],"implemented":[65,77],"various":[67,98],"ways":[68],"and":[69,81,101],"with":[70,89,96,102],"several":[71,78],"parameters":[72,105],"controlling":[73,104],"it.":[74],"have":[76],"different":[79],"algorithms":[80],"created":[82],"an":[83],"application":[84,118],"that":[85],"computes":[86],"minimal":[90],"(or":[91],"maximal)":[92],"area.":[93],"experimented":[95],"algorithmic":[99],"options":[100],"algorithm":[108],"tune":[110],"up":[111],"pipeline.":[113],"Then,":[114],"we":[115],"executed":[116],"benchmark":[123],"instances,":[124],"exploiting":[125],"grid":[127],"servers,":[129],"obtain":[131],"near":[132],"optimal":[133],"results.":[134]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4214829407","counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":6}],"updated_date":"2025-03-24T22:53:32.759065","created_date":"2022-03-05"}