{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T06:25:31Z","timestamp":1764570331578},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540357537"},{"type":"electronic","value":"9783540357551"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11785293_23","type":"book-chapter","created":{"date-parts":[[2006,6,26]],"date-time":"2006-06-26T05:24:10Z","timestamp":1151299450000},"page":"232-241","source":"Crossref","is-referenced-by-count":3,"title":["Approximation Algorithms for the Minimum Convex Partition Problem"],"prefix":"10.1007","author":[{"given":"Christian","family":"Knauer","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Spillner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/978-3-642-55566-4_6","volume-title":"Discrete and Computational Geometry: The Goodman-Pollack Festschrift","author":"E.M. Arkin","year":"2003","unstructured":"Arkin, E.M., Fekete, S.P., Hurtado, F., Mitchell, J.S.B., Noy, M., Sacrist\u00e1n, V., Sethia, S.: On the reflexivity of point sets. In: Discrete and Computational Geometry: The Goodman-Pollack Festschrift, vol.\u00a025, pp. 139\u2013156. Springer, Heidelberg (2003)"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1142\/S021819590200089X","volume":"12","author":"P. Bose","year":"2002","unstructured":"Bose, P., Brodnik, A., Carlsson, S., Demaine, E.D., Fleischer, R., L\u00f3pez-Ortiz, A., Morin, P., Munro, J.I.: Online routing in convex subdivisions. Internat. J. Comput. Geom. Appl.\u00a012, 283\u2013296 (2002)","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/TIT.1985.1057060","volume":"31","author":"B. Chazelle","year":"1985","unstructured":"Chazelle, B.: On the convex layers of a planar set. IEEE Trans. Inform. Theory\u00a031, 509\u2013517 (1985)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"23_CR4","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.\u00a0109, 95\u2013107 (2001)","journal-title":"Discrete Appl. Math."},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/11589440_9","volume-title":"Discrete and Computational Geometry","author":"M. Grantson","year":"2005","unstructured":"Grantson, M., Levcopoulos, C.: A fixed-parameter algorithm for the minimum number convex partition problem. In: Akiyama, J., Kano, M., Tan, X. (eds.) JCDCG 2004. LNCS, vol.\u00a03742, pp. 83\u201394. Springer, Heidelberg (2005)"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1142\/S0218195902000803","volume":"12","author":"J.M. Keil","year":"2002","unstructured":"Keil, J.M., Snoeyink, J.: On the time bound for convex decomposition of simple polygons. Internat. J. Comput. Geom. Appl.\u00a012, 181\u2013192 (2002)","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BFb0012784","volume-title":"Automata, Languages, and Programming","author":"A. Lingas","year":"1982","unstructured":"Lingas, A.: The power of non-rectilinear holes. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol.\u00a0140, pp. 369\u2013383. Springer, Heidelberg (1982)"},{"key":"23_CR8","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., Rivero-Campo, E., Urrutia, J.: A note on convex decompositions of a set of points in the plane. Graphs and Combinatorics\u00a020, 223\u2013231 (2004)","journal-title":"Graphs and Combinatorics"},{"key":"23_CR9","unstructured":"Spillner, A.: Optimal convex partitions of point sets with few inner points. In: CCCG, pp. 34\u201337 (2005)"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11785293_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:19:18Z","timestamp":1619507958000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11785293_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540357537","9783540357551"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11785293_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}