{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T06:34:04Z","timestamp":1764570844100,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030174019"},{"type":"electronic","value":"9783030174026"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17402-6_3","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T13:37:00Z","timestamp":1558359420000},"page":"25-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Minimum Convex Partition of Point Sets"],"prefix":"10.1007","author":[{"given":"Allan S.","family":"Barboza","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cid C.","family":"de Souza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro J.","family":"de Rezende","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,6]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Barboza, A.S., de Souza, C.C., de Rezende, P.J.: Minimum Convex Partition of Point Sets - Benchmark Instances and Solutions (2018). www.ic.unicamp.br\/~cid\/Problem-instances\/Convex-Partition","DOI":"10.1007\/978-3-030-17402-6_3"},{"issue":"4","key":"3_CR2","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1142\/S021819590200089X","volume":"12","author":"P Bose","year":"2002","unstructured":"Bose, P., et al.: Online routing in convex subdivisions. Int. J. Comput. Geom. Appl. 12(4), 283\u2013296 (2002)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"1\u20132","key":"3_CR3","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0166-218X(00)00237-7","volume":"109","author":"T Fevens","year":"2001","unstructured":"Fevens, T., Meijer, H., Rappaport, D.: Minimum convex partition of a constrained point set. Discrete Appl. Math. 109(1\u20132), 95\u2013107 (2001)","journal-title":"Discrete Appl. Math."},{"key":"3_CR4","unstructured":"Garc\u00eda-L\u00f3pez, J., Nicol\u00e1s, M.: Planar point sets with large minimum convex partitions. In: Abstracts 22nd European Workshop on Computational Geometry, pp. 51\u201354 (2006)"},{"issue":"6","key":"3_CR5","doi-asserted-by":"publisher","first-page":"1714","DOI":"10.1016\/j.disc.2008.02.008","volume":"309","author":"K Hosono","year":"2009","unstructured":"Hosono, K.: On convex decompositions of a planar point set. Discrete Math. 309(6), 1714\u20131717 (2009)","journal-title":"Discrete Math."},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/B978-044482537-7\/50012-7","volume-title":"Handbook of Computational Geometry","author":"JM Keil","year":"2000","unstructured":"Keil, J.M.: Polygon decomposition. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 491\u2013518. North-Holland, Amsterdam (2000)"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/11785293_23","volume-title":"Algorithm Theory \u2013 SWAT 2006","author":"C Knauer","year":"2006","unstructured":"Knauer, C., Spillner, A.: Approximation algorithms for the minimum convex partition problem. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol. 4059, pp. 232\u2013241. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11785293_23"},{"issue":"1","key":"3_CR8","first-page":"1","volume":"5","author":"M L\u00f6ffler","year":"2014","unstructured":"L\u00f6ffler, M., Mulzer, W.: Unions of onions: preprocessing imprecise points for fast onion decomposition. J. Comput. Geom. 5(1), 1\u201313 (2014)","journal-title":"J. Comput. Geom."},{"issue":"2","key":"3_CR9","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s00373-004-0555-2","volume":"20","author":"V Neumann-Lara","year":"2004","unstructured":"Neumann-Lara, V., Rivera-Campo, E., Urrutia, J.: A note on convex decompositions of a set of points in the plane. Graphs Comb. 20(2), 223\u2013231 (2004)","journal-title":"Graphs Comb."},{"issue":"4","key":"3_CR10","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1016\/j.jda.2008.07.002","volume":"6","author":"A Spillner","year":"2008","unstructured":"Spillner, A.: A fixed parameter algorithm for optimal convex partitions. J. Discrete Algorithms 6(4), 561\u2013569 (2008)","journal-title":"J. Discrete Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17402-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:27:03Z","timestamp":1710347223000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17402-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030174019","9783030174026"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17402-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/easyconferences.eu\/ciac2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"95","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}