{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:58:23Z","timestamp":1725559103439},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_15","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:15:37Z","timestamp":1279044937000},"page":"149-158","source":"Crossref","is-referenced-by-count":0,"title":["Equipartitions of Measures by 2-Fans"],"prefix":"10.1007","author":[{"given":"Sergey","family":"Bereg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-46515-7_1","volume-title":"Discrete and Computational Geometry","author":"J. Akiyama","year":"2000","unstructured":"Akiyama, J., Kaneko, A., Kano, M., Nakamura, G., Rivera-Campo, E., Tokunaga, S., Urrutia, J.: Radial perfect partitions of convex sets in the plane. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 1998. LNCS, vol.\u00a01763, pp. 1\u201313. Springer, Heidelberg (2000)"},{"key":"15_CR2","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-3-642-58043-7_10","volume-title":"New Trends in Discrete and Computational Geometry","author":"I. B\u00e1r\u00e1ny","year":"1993","unstructured":"B\u00e1r\u00e1ny, I.: Geometric and combinatorial applications of Borsuk\u2019s theorem. In: Pach, J. (ed.) New Trends in Discrete and Computational Geometry. Algorithms and Combinatorics, vol.\u00a010, pp. 235\u2013249. Springer, Heidelberg (1993)"},{"issue":"3","key":"15_CR3","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s00454-001-0003-5","volume":"25","author":"I. B\u00e1r\u00e1ny","year":"2001","unstructured":"B\u00e1r\u00e1ny, I., Matou\u0161ek, J.: Simultaneous partitions of measures by k-fans. Discrete Comput. Geom.\u00a025(3), 317\u2013334 (2001)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"15_CR4","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s00454-001-0071-6","volume":"27","author":"I. B\u00e1r\u00e1ny","year":"2002","unstructured":"B\u00e1r\u00e1ny, I., Matou\u0161ek, J.: Equipartition of two measures by a 4-fan. Discrete Comput. Geom.\u00a027(3), 293\u2013301 (2002)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"15_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00454-001-0092-1","volume":"28","author":"M.W. Bern","year":"2002","unstructured":"Bern, M.W., Eppstein, D.: Multivariate regression depth. Discrete Comput. Geom.\u00a028(1), 1\u201317 (2002)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"15_CR6","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1007\/s4540010065","volume":"24","author":"S. Bespamyatnikh","year":"2000","unstructured":"Bespamyatnikh, S., Kirkpatrick, D., Snoeyink, J.: Generalizing ham sandwich cuts to equitable subdivisions. Discrete Comput. Geom.\u00a024(4), 605\u2013622 (2000), http:\/\/springerlink.metapress.com\/openurl.asp?genre=article&issn=0179-5376&volume=24&issue=4&spage=605","journal-title":"Discrete Comput. Geom."},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Bose, P., Demaine, E.D., Hurtado, F., Iacono, J., Langerman, S., Morin, P.: Geodesic ham-sandwich cuts. In: Proc. 20th Annu. ACM Sympos. Comput. Geom (2004), http:\/\/www-ma2.upc.es\/~hurtado\/ham.pdf","DOI":"10.1145\/997817.997821"},{"issue":"1","key":"15_CR8","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0925-7721(97)00025-4","volume":"10","author":"H. Br\u00f6nnimann","year":"1998","unstructured":"Br\u00f6nnimann, H., Chazelle, B.: Optimal slope selection via cuttings. Comput. Geom. Theory Appl.\u00a010(1), 23\u201329 (1998)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"4","key":"15_CR9","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1137\/0218055","volume":"18","author":"R. Cole","year":"1989","unstructured":"Cole, R., Salowe, J., Steiger, W., Szemer\u00e9di, E.: An optimal-time algorithm for slope selection. SIAM J. Comput.\u00a018(4), 792\u2013810 (1989)","journal-title":"SIAM J. Comput."},{"key":"15_CR10","unstructured":"D\u00edaz, M., O\u2019Rourke, J.: Ham-sandwich sectioning of polygons. In: Proc. 2nd Canad. Conf. Comput. Geom, pp. 282\u2013286 (1990)"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0218195992000020","volume":"2","author":"M.B. Dillencourt","year":"1992","unstructured":"Dillencourt, M.B., Mount, D.M., Netanyahu, N.S.: A randomized algorithm for slope selection. Internat. J. Comput. Geom. Appl.\u00a02, 1\u201327 (1992)","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"15_CR12","unstructured":"Dobkin, D.P., Edelsbrunner, H.: Ham-sandwich theorems applied to intersection problems. In: Proc. 10th Internat. Workshop Graph-Theoret. Concepts Comput. Sci., pp. 88\u201399 (1984)"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0747-7171(86)80020-7","volume":"2","author":"H. Edelsbrunner","year":"1986","unstructured":"Edelsbrunner, H., Waupotitsch, R.: Computing a ham-sandwich cut in two dimensions. J. Symbolic Comput.\u00a02, 171\u2013178 (1986)","journal-title":"J. Symbolic Comput."},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-540-46515-7_11","volume-title":"Discrete and Computational Geometry","author":"H. Ito","year":"2000","unstructured":"Ito, H., Uehara, H., Yokoyama, M.: 2-dimension harn sandwich theorem for partitioning into three convex pieces. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 1998. LNCS, vol.\u00a01763, pp. 129\u2013157. Springer, Heidelberg (2000)"},{"key":"15_CR15","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/S0925-7721(99)00024-3","volume":"13","author":"A. Kaneko","year":"1999","unstructured":"Kaneko, A., Kano, M.: Balanced partitions of two sets of points in the plane. Comput. Geom. Theory Appl.\u00a013, 253\u2013261 (1999)","journal-title":"Comput. Geom. Theory Appl."},{"key":"15_CR16","unstructured":"Kano, M.: Personal communication"},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/BF02574017","volume":"11","author":"C.-Y. Lo","year":"1994","unstructured":"Lo, C.-Y., Matou\u0161ek, J., Steiger, W.L.: Algorithms for ham-sandwich cuts. Discrete Comput. Geom.\u00a011, 433\u2013452 (1994)","journal-title":"Discrete Comput. Geom."},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0020-0190(91)90177-J","volume":"39","author":"J. Matou\u0161ek","year":"1991","unstructured":"Matou\u0161ek, J.: Randomized optimal algorithm for slope selection. Inform. Process. Lett.\u00a039, 183\u2013187 (1991)","journal-title":"Inform. Process. Lett."},{"key":"15_CR19","volume-title":"Using the Borsuk-Ulam Theorem","author":"J. Matou\u0161ek","year":"2003","unstructured":"Matou\u0161ek, J.: Using the Borsuk-Ulam Theorem. Springer, Heidelberg (2003)"},{"issue":"1","key":"15_CR20","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s003730200011","volume":"18","author":"T. Sakai","year":"2002","unstructured":"Sakai, T.: Balanced convex partitions of measures in R 2. Graphs and Combinatorics\u00a018(1), 169\u2013192 (2002)","journal-title":"Graphs and Combinatorics"},{"key":"15_CR21","unstructured":"Steiger, W.: Algorithms for ham sandwich cuts. In: Proc. 5th Canad. Conf. Comput. Geom, p. 48 (1993)"},{"issue":"3","key":"15_CR22","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s00454-001-0002-6","volume":"25","author":"S.T. Vre\u0107ica","year":"2001","unstructured":"Vre\u0107ica, S.T., \u017divaljevi\u0107, R.T.: Conical equipartitions of mass distributions. Discrete Comput. Geom.\u00a025(3), 335\u2013350 (2001)","journal-title":"Discrete Comput. Geom."},{"key":"15_CR23","first-page":"209","volume-title":"Handbook of Discrete and Computational Geometry, ch.\u00a011","author":"R.T. \u017divaljevi\u0107","year":"1997","unstructured":"\u017divaljevi\u0107, R.T.: Topological methods. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, ch.\u00a011, Boca Raton, FL, pp. 209\u2013224. CRC Press, Boca Raton (1997)"},{"key":"15_CR24","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1112\/blms\/22.2.183","volume":"22","author":"R.T. \u017divaljevi\u0107","year":"1990","unstructured":"\u017divaljevi\u0107, R.T., Vre\u0107ica, S.T.: An extension of the ham sandwich theorem. Bull. London Math. Soc.\u00a022, 183\u2013186 (1990)","journal-title":"Bull. London Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:21:21Z","timestamp":1605759681000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}