乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:09:59Z","timestamp":1740143399854,"version":"3.37.3"},"reference-count":15,"publisher":"Association for Computing Machinery (ACM)","funder":[{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"crossref","award":["#88882.329122\/2019-01"],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Brazilian National Council for Scientific and Technological Development","award":["#311140\/2014-9, #309627\/2017-6, #304727\/2014-8, #314384\/2018-9, #140300\/2020-1, #313329\/2020-6"]},{"DOI":"10.13039\/501100001807","name":"S\u00e3o Paulo Research Foundation","doi-asserted-by":"crossref","award":["#2020\/09691-0, #2018\/26434-0, #2015\/11937-9, #2014\/12236-1"],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Fund for Support to Teaching, Research and Outreach Activities"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ACM J. Exp. Algorithmics"],"published-print":{"date-parts":[[2022,12,31]]},"abstract":"In this article, we describe an empirical study conducted on problems of Polygonizations with Optimal Area: given a set

\\( S \\)<\/jats:tex-math><\/jats:inline-formula>of points in the plane, find a simple polygon with minimum (Min-Area<\/jats:sc>) or maximum (Max-Area<\/jats:sc>) area whose vertices are all the points of

\\( S \\)<\/jats:tex-math><\/jats:inline-formula>. Both problems arise in the context of pattern recognition, image reconstruction, and clustering. Higher dimensional variants play a role in object modeling, as well as optimal surface design. BothMin-Area<\/jats:sc>andMax-Area<\/jats:sc>are in NP-hard, and heuristics as well as exact methods have already been proposed. Our main contributions include the design and implementation of novel constructive heuristics and local search procedures to improve the solutions obtained by the former methods for the two problems.<\/jats:p>","DOI":"10.1145\/3504001","type":"journal-article","created":{"date-parts":[[2022,5,25]],"date-time":"2022-05-25T09:02:26Z","timestamp":1653469346000},"page":"1-25","source":"Crossref","is-referenced-by-count":2,"title":["Triangle-Based Heuristics for Area Optimal Polygonizations"],"prefix":"10.1145","volume":"27","author":[{"given":"Natanael","family":"Ramos","sequence":"first","affiliation":[{"name":"University of Campinas, Campinas, SP, Brazil"}]},{"given":"Ra\u00ed C.","family":"de Jesus","sequence":"additional","affiliation":[{"name":"University of Campinas, Campinas, SP, Brazil"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9529-4253","authenticated-orcid":false,"given":"Pedro J.","family":"de Rezende","sequence":"additional","affiliation":[{"name":"University of Campinas, Campinas, SP, Brazil"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5945-0845","authenticated-orcid":false,"given":"Cid C.","family":"de Souza","sequence":"additional","affiliation":[{"name":"University of Campinas, Campinas, SP, Brazil"}]},{"given":"Fbio L.","family":"Usberti","sequence":"additional","affiliation":[{"name":"University of Campinas, Campinas, SP, Brazil"}]}],"member":"320","published-online":{"date-parts":[[2022,5,25]]},"reference":[{"key":"e_1_3_2_2_2","volume-title":"Introduction to Algorithms (3rd ed.)","author":"Cormen Thomas H.","year":"2009","unstructured":"Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms (3rd ed.). The MIT Press."},{"key":"e_1_3_2_3_2","article-title":"Greedy and local search solutions to the minimum and maximum area","author":"Crombez Lo\u00efc","year":"2021","unstructured":"Lo\u00efc Crombez, Guilherme D. da Fonseca, and Yan Gerard. 2021. Greedy and local search solutions to the minimum and maximum area. Journal of Experimental Algorithmics (2021).","journal-title":"Journal of Experimental Algorithmics"},{"key":"e_1_3_2_4_2","article-title":"Area-optimal simple polygonalizations: The CG challenge 2019","author":"Demaine Erik D.","year":"2021","unstructured":"Erik D. Demaine, S\u00e1ndor P. Fekete, Phillip Keldenich, Domink Krupke, and Joseph S. B. Mitchell. 2021. Area-optimal simple polygonalizations: The CG challenge 2019. Journal of Experimental Algorithmics (2021).","journal-title":"Journal of Experimental Algorithmics"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.5555\/1248547.1248548"},{"key":"e_1_3_2_6_2","article-title":"2-Opt moves and flips for area-optimal polygonalizations","author":"Eder G\u00fcnther","year":"2021","unstructured":"G\u00fcnther Eder, Martin Held, Stein\u00fe\u00f3r Jasonarson, Philipp Mayer, and Peter Palfrader. 2021. 2-Opt moves and flips for area-optimal polygonalizations. Journal of Experimental Algorithmics (2021).","journal-title":"Journal of Experimental Algorithmics"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/160985.161016"},{"key":"e_1_3_2_8_2","article-title":"Area-optimal polygonization using simulated annealing","author":"Goren Nir","year":"2021","unstructured":"Nir Goren, Efi Fogel, and Dan Halperin. 2021. Area-optimal polygonization using simulated annealing. Journal of Experimental Algorithmics (2021).","journal-title":"Journal of Experimental Algorithmics"},{"issue":"2","key":"e_1_3_2_9_2","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1080\/00031305.1998.10480559","article-title":"Violin plots: A box plot-density trace synergism","volume":"52","author":"Hintze Jerry L.","year":"1998","unstructured":"Jerry L. Hintze and Ray D. Nelson. 1998. Violin plots: A box plot-density trace synergism. The American Statistician 52, 2 (1998), 181\u2013184.","journal-title":"The American Statistician"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01937271"},{"key":"e_1_3_2_11_2","article-title":"Optimal area polygonization by triangulation and ray-tracing","author":"Lepagnot Julien","year":"2021","unstructured":"Julien Lepagnot, Laurent Moalic, and Dominique Schmitt. 2021. Optimal area polygonization by triangulation and ray-tracing. Journal of Experimental Algorithmics (2021).","journal-title":"Journal of Experimental Algorithmics"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.5555\/40599"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.5555\/289380"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.5555\/1529939"},{"key":"e_1_3_2_16_2","volume-title":"CGAL User and Reference Manual (v. 4.13)","author":"Project The CGAL","year":"2018","unstructured":"The CGAL Project. 2018. CGAL User and Reference Manual (v. 4.13). CGAL Editorial Board. Retrieved from https:\/\/doc.cgal.org\/4.13\/Manual\/packages.html."}],"container-title":["ACM Journal of Experimental Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3504001","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,25]],"date-time":"2024-09-25T21:44:18Z","timestamp":1727300658000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3504001"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,25]]},"references-count":15,"alternative-id":["10.1145\/3504001"],"URL":"https:\/\/doi.org\/10.1145\/3504001","relation":{},"ISSN":["1084-6654","1084-6654"],"issn-type":[{"type":"print","value":"1084-6654"},{"type":"electronic","value":"1084-6654"}],"subject":[],"published":{"date-parts":[[2022,5,25]]}}}