{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T11:53:33Z","timestamp":1673092413817},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,3,17]],"date-time":"2010-03-17T00:00:00Z","timestamp":1268784000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1007\/s10878-010-9310-1","type":"journal-article","created":{"date-parts":[[2010,3,16]],"date-time":"2010-03-16T14:10:00Z","timestamp":1268748600000},"page":"409-425","source":"Crossref","is-referenced-by-count":5,"title":["Convex partitions with 2-edge connected dual graphs"],"prefix":"10.1007","volume":"22","author":[{"given":"Marwan","family":"Al-Jubeh","sequence":"first","affiliation":[]},{"given":"Michael","family":"Hoffmann","sequence":"additional","affiliation":[]},{"given":"Mashhood","family":"Ishaque","sequence":"additional","affiliation":[]},{"given":"Diane L.","family":"Souvaine","sequence":"additional","affiliation":[]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,3,17]]},"reference":[{"key":"9310_CR1","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1016\/j.comgeo.2008.12.005","volume":"42","author":"O Aichholzer","year":"2009","unstructured":"Aichholzer\u00a0O, Bereg\u00a0S, Dumitrescu\u00a0A, Garc\u00eda\u00a0A, Huemer\u00a0C, Hurtado\u00a0F, Kano\u00a0M, M\u00e1rquez\u00a0A, Rappaport\u00a0D, Smorodinsky\u00a0S, Souvaine\u00a0D, Urrutia\u00a0J, Wood\u00a0D (2009) Compatible geometric matchings. Comput Geom 42:617\u2013626","journal-title":"Comput Geom"},{"key":"9310_CR2","first-page":"192","volume-title":"Proc 14th Sympos Comput Geom","author":"A Andrzejak","year":"1998","unstructured":"Andrzejak\u00a0A, Aronov\u00a0B, Har-Peled\u00a0S, Seidel\u00a0R, Welzl\u00a0E (1998) Results on k-sets and j-facets via continuous motion. In: Proc 14th Sympos Comput Geom. ACM, New York, pp\u00a0192\u2013199"},{"key":"9310_CR3","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1090\/S0002-9939-1974-0370599-7","volume":"45","author":"TF Banchoff","year":"1974","unstructured":"Banchoff\u00a0TF (1974) Global geometry of polygons I: The theorem of Fabricius\u2013Bjerre. Proc Am Math Soc 45:237\u2013241","journal-title":"Proc Am Math Soc"},{"key":"9310_CR4","unstructured":"Benbernou\u00a0N, Demaine\u00a0ED, Demaine\u00a0ML, Hoffmann\u00a0M, Ishaque\u00a0M, Souvaine\u00a0DL, T\u00f3th\u00a0CD (2007) Disjoint segments have convex partitions with 2-edge connected dual graphs. In: Proc Canadian Conf Comput Geom, pp\u00a013\u201316"},{"key":"9310_CR5","unstructured":"Benbernou\u00a0N, Demaine\u00a0ED, Demaine\u00a0ML, Hoffmann\u00a0M, Ishaque\u00a0M, Souvaine\u00a0DL, T\u00f3th\u00a0CD (2008) Erratum for \u201cDisjoint segments have convex partitions with 2-edge connected dual graphs\u201d. In: Proc Canadian Conf Comput Geom, p\u00a0223"},{"issue":"9","key":"9310_CR6","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TC.1979.1675432","volume":"28","author":"JL Bentley","year":"1979","unstructured":"Bentley\u00a0JL, Ottmann\u00a0TA (1979) Algorithms for reporting and counting geometric intersections. IEEE Trans Comput\u00a0C 28(9):643\u2013647","journal-title":"IEEE Trans Comput\u00a0C"},{"issue":"3","key":"9310_CR7","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s00454-001-0042-y","volume":"26","author":"P Bose","year":"2001","unstructured":"Bose\u00a0P, Houle\u00a0ME, Toussaint\u00a0GT (2001) Every set of disjoint line segments admits a binary tree. Discrete Comput Geom 26(3):387\u2013410","journal-title":"Discrete Comput Geom"},{"key":"9310_CR8","doi-asserted-by":"crossref","unstructured":"Carlsson\u00a0JG, Armbruster\u00a0B, Ye\u00a0Y (2009) Finding equitable convex partitions of points in a polygon efficiently. ACM Trans Algorithms (to appear)","DOI":"10.1145\/1824777.1824792"},{"key":"9310_CR9","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/B978-0-444-87806-9.50009-8","volume":"2","author":"B Chazelle","year":"1985","unstructured":"Chazelle\u00a0B, Dobkin\u00a0DP (1985) Optimal convex decompositions. Comput Geom 2:63\u2013133","journal-title":"Comput Geom"},{"key":"9310_CR10","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/11589440_9","volume-title":"Proc Japan Conf Discrete Comput Geom","author":"M Grantson","year":"2005","unstructured":"Grantson\u00a0M, Levcopoulos\u00a0C (2005) A\u00a0fixed parameter algorithm for the minimum number convex partition problem. In: Proc Japan Conf Discrete Comput Geom, Tokyo, 2004. LNCS, vol\u00a03746. Springer, Berlin, pp\u00a083\u201394"},{"key":"9310_CR11","first-page":"51","volume-title":"Proc 25th Sympos Comput Geom","author":"M Ishaque","year":"2009","unstructured":"Ishaque\u00a0M, Speckmann\u00a0B, T\u00f3th\u00a0CD (2009) Shooting permanent rays among disjoint polygons in the plane. In: Proc 25th Sympos Comput Geom. ACM, New York, pp\u00a051\u201360"},{"issue":"2","key":"9310_CR12","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s00454-002-2808-2","volume":"28","author":"A Kaneko","year":"2002","unstructured":"Kaneko\u00a0A, Kano\u00a0M (2002) Perfect partitions of convex sets in the plane. Discrete Comput Geom 28(2):211\u2013222","journal-title":"Discrete Comput Geom"},{"key":"9310_CR13","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/B978-044482537-7\/50012-7","volume-title":"Handbook of computational geometry","author":"M Keil","year":"2000","unstructured":"Keil\u00a0M (2000) Polygon decomposition. In: Sack J-R, Urrutia\u00a0J (eds) Handbook of computational geometry. Elsevier, Amsterdam, pp\u00a0491\u2013518"},{"key":"9310_CR14","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1142\/S0218195902000803","volume":"12","author":"M Keil","year":"2002","unstructured":"Keil\u00a0M, Snoeyink\u00a0J (2002) On the time bound for convex decomposition of simple polygons. Int J Comput Geom Appl 12:181\u2013192","journal-title":"Int J Comput Geom Appl"},{"key":"9310_CR15","series-title":"LNCS","first-page":"232","volume-title":"Proc SWAT","author":"C Knauer","year":"2006","unstructured":"Knauer\u00a0C, Spillner\u00a0A (2006) Approximation algorithms for the minimum convex partition problem. In: Proc SWAT. LNCS, vol\u00a04059. Springer, Berlin, pp\u00a0232\u2013241"},{"issue":"3","key":"9310_CR16","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/s00454-007-9025-y","volume":"40","author":"DW Krumme","year":"2008","unstructured":"Krumme\u00a0DW, Rafalin\u00a0E, Souvaine\u00a0DL, T\u00f3th\u00a0CD (2008) Tight bounds for connecting sites across barriers. Discrete Comput Geom 40(3):377\u2013394","journal-title":"Discrete Comput Geom"},{"issue":"1\u20132","key":"9310_CR17","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.comgeo.2005.10.005","volume":"35","author":"J-M Lien","year":"2006","unstructured":"Lien J-M, Amato\u00a0NM (2006) Approximate convex decomposition of polygons. Comput Geom 35(1\u20132):100\u2013123","journal-title":"Comput Geom"},{"key":"9310_CR18","series-title":"LNCS","first-page":"369","volume-title":"Proc 9th ICALP","author":"A Lingas","year":"1982","unstructured":"Lingas\u00a0A (1982) The power of non-rectilinear holes. In: Proc 9th ICALP. LNCS, vol 140. Springer, Berlin, pp\u00a0369\u2013383"},{"issue":"4","key":"9310_CR19","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/s00454-005-1184-0","volume":"34","author":"I Streinu","year":"2005","unstructured":"Streinu\u00a0I (2005) Pseudo-triangulations, rigidity and motion planning. Discrete Comput Geom 34(4):587\u2013635","journal-title":"Discrete Comput Geom"},{"key":"9310_CR20","first-page":"1746","volume-title":"Proc INFOCOM","author":"G Tan","year":"2009","unstructured":"Tan\u00a0G, Bertier\u00a0M, Kermarrec A-M (2009) Convex partition of sensor networks and its use in virtual coordinate geographic routing. In: Proc INFOCOM. IEEE Comput Soc, Los Alamitos, pp\u00a01746\u20131754"},{"issue":"1\u20132","key":"9310_CR21","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0925-7721(02)00130-X","volume":"25","author":"CD T\u00f3th","year":"2003","unstructured":"T\u00f3th\u00a0CD (2003) Guarding disjoint triangles and claws in the plane. Comput Geom 25(1\u20132):51\u201365","journal-title":"Comput Geom"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9310-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9310-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9310-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:16Z","timestamp":1559276296000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9310-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,17]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["9310"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9310-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,17]]}}}