{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T17:21:22Z","timestamp":1770744082114,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642311543","type":"print"},{"value":"9783642311550","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31155-0_19","type":"book-chapter","created":{"date-parts":[[2012,6,13]],"date-time":"2012-06-13T02:21:27Z","timestamp":1339554087000},"page":"213-224","source":"Crossref","is-referenced-by-count":3,"title":["Minimum Convex Partitions and Maximum Empty Polytopes"],"prefix":"10.1007","author":[{"given":"Adrian","family":"Dumitrescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sariel","family":"Har-Peled","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","unstructured":"Aichholzer, O., Krasser, H.: The point set order type data base: A collection of applications and results. In: Proc. 13th Canadian Conf. on Comput. Geom., Waterloo, pp. 17\u201320 (2001)"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1017\/S0963548300000225","volume":"1","author":"N. Alon","year":"1992","unstructured":"Alon, N., B\u00e1r\u00e1ny, I., F\u00fcredi, Z., Kleitman, D.: Point selections and weak \u03b5-nets for convex hulls. Combinatorics, Probability & Computing\u00a01, 189\u2013200 (1992)","journal-title":"Combinatorics, Probability & Computing"},{"issue":"2","key":"19_CR3","doi-asserted-by":"crossref","first-page":"295","DOI":"10.2140\/pjm.1971.37.295","volume":"37","author":"R.P. Bambah","year":"1971","unstructured":"Bambah, R.P., Woods, A.C.: On a problem of Danzer. Pacific J. Math.\u00a037(2), 295\u2013301 (1971)","journal-title":"Pacific J. Math."},{"key":"19_CR4","series-title":"Cambridge Tracts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511565984","volume-title":"Irregularities of Distributions","author":"J. Beck","year":"1987","unstructured":"Beck, J., Chen, W.: Irregularities of Distributions. Cambridge Tracts in Mathematics, vol.\u00a089. Cambridge University Press, Cambridge (1987)"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer (2008)","DOI":"10.1007\/978-3-540-77974-2"},{"key":"19_CR6","volume-title":"Algorithms","author":"S. Dasgupta","year":"2008","unstructured":"Dasgupta, S., Papadimitriou, C., Vazirani, U.: Algorithms. McGraw-Hill, New York (2008)"},{"key":"19_CR7","unstructured":"Dumitrescu, A., Har-Peled, S., T\u00f3th, C.D.: Minimum convex partitions and maximum empty polytopes, arXiv:1112.1124"},{"issue":"3","key":"19_CR8","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/s00453-009-9329-9","volume":"60","author":"A. Dumitrescu","year":"2011","unstructured":"Dumitrescu, A., T\u00f3th, C.D.: Minimum weight convex Steiner partitions. Algorithmica\u00a060(3), 627\u2013652 (2011)","journal-title":"Algorithmica"},{"issue":"1","key":"19_CR9","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF02187823","volume":"7","author":"D. Eppstein","year":"1992","unstructured":"Eppstein, D., Overmars, M., Rote, G., Woeginger, G.: Finding minimum area k-gons. Discrete Comput. Geom.\u00a07(1), 45\u201358 (1992)","journal-title":"Discrete Comput. Geom."},{"issue":"1-2","key":"19_CR10","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(1-2), 95\u2013107 (2001)","journal-title":"Discrete Appl. Math."},{"key":"19_CR11","unstructured":"F\u00fcredi, Z., Pach, J.: Traces of finite sets: extremal problems and geometric applications. In: Frankl, P., F\u00fcredi, Z., Katona, G., Mikl\u00f3s, D. (eds.) Extremal Problems for Finite Sets, Budapest. Bolyai Soc. Math. Studies, vol.\u00a03, pp. 251\u2013282 (1994)"},{"key":"19_CR12","unstructured":"Garc\u00eda L\u00f3pez, J., Nicol\u00e1s, C.: Planar point sets with large minimum convex partitions. In: Proc. 22nd European Workshop on Comput. Geom., pp. 51\u201354 (2006)"},{"key":"19_CR13","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":"19_CR14","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0925-7721(97)00031-X","volume":"10","author":"S. Har-Peled","year":"1998","unstructured":"Har-Peled, S.: An output sensitive algorithm for discrete convex hulls. Comput. Geom. Theory Appl.\u00a010, 125\u2013138 (1998)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"2","key":"19_CR15","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01994880","volume":"32","author":"J. Hershberger","year":"1992","unstructured":"Hershberger, J., Suri, S.: Applications of a semi-dynamic convex hull algorithm. BIT\u00a032(2), 249\u2013267 (1992)","journal-title":"BIT"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"482","DOI":"10.4153\/CMB-1983-077-8","volume":"26","author":"J. Horton","year":"1983","unstructured":"Horton, J.: Sets with no empty convex 7-gons. Canadian Math. Bulletin\u00a026, 482\u2013484 (1983)","journal-title":"Canadian Math. Bulletin"},{"key":"19_CR17","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.\u00a04059, pp. 232\u2013241. Springer, Heidelberg (2006)"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Matou\u0161ek, J.: Geometric Discrepancy: An Illustrated Guide. Springer (1999)","DOI":"10.1007\/978-3-642-03942-3"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry. Springer (2002)","DOI":"10.1007\/978-1-4613-0039-7"},{"issue":"2","key":"19_CR20","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 partitions of a set of points in the plane. Graphs and Combinatorics\u00a020(2), 223\u2013231 (2004)","journal-title":"Graphs and Combinatorics"},{"key":"19_CR21","unstructured":"Sakai, T., Urrutia, J.: Convex partitions of point sets in the plane. In: Proc. 7th Japan Conf. on Comput. Geom. and Graphs, Kanazawa. JAIST (2009)"},{"issue":"4","key":"19_CR22","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\u00a06(4), 561\u2013569 (2008)","journal-title":"J. Discrete Algorithms"},{"issue":"1-3","key":"19_CR23","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0012-365X(92)90665-3","volume":"108","author":"P. Valtr","year":"1992","unstructured":"Valtr, P.: Sets in \u211d\n                  d\n                 with no large empty convex subsets. Discrete Mathematics\u00a0108(1-3), 115\u2013124 (1992)","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31155-0_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:48:30Z","timestamp":1620128910000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31155-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642311543","9783642311550"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31155-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}