{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:09:51Z","timestamp":1725516591749},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540693260"},{"type":"electronic","value":"9783540693550"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69355-0_13","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"141-155","source":"Crossref","is-referenced-by-count":1,"title":["Equal-Area Locus-Based Convex Polygon Decomposition"],"prefix":"10.1007","author":[{"given":"David","family":"Adjiashvili","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/b75044","volume-title":"Discrete and Computational Geometry","author":"J.M. Akiyama","year":"2000","unstructured":"Akiyama, J.M., Kaneko, A., Kano, M., Nakamura, G., Rivera-Campo, E., Tokunaga, S., Urrutia, J.: Radial perfect partitions of convex sets. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 1998. LNCS, vol.\u00a01763, pp. 1\u201313. Springer, Heidelberg (2000)"},{"key":"13_CR2","unstructured":"Akiyama, J.M., Nakamura, G., Rivera-Campo, E., Urrutia, J.: Perfect division of a cake. In: Proc. 10th Canadian Conf. on Computational Geometry, pp. 114\u2013115 (1998)"},{"key":"13_CR3","volume-title":"Behavior-Based Robotics","author":"R.C. Arkin","year":"1998","unstructured":"Arkin, R.C.: Behavior-Based Robotics. MIT Press, Cambridge (1998)"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Aronov, B., Carmi, P., Katz, M.J.: Minimum-cost load-balancing partitions. In: Proc. 22nd ACM Symp. on Computational geometry (SoCG), pp. 301\u2013308 (2006)","DOI":"10.1145\/1137856.1137901"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Balch, T., Parker, L.E. (eds.): Robot Teams: From Diversity to Polymorphism. A.K. Peters (2001)","DOI":"10.1201\/9781439863671"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Barany, I., Matousek, J.: Simultaneous partitions of measures by k-fans. Discrete and Computational Geometry, pp. 317\u2013334 (2001)","DOI":"10.1007\/s00454-001-0003-5"},{"key":"13_CR7","unstructured":"Bast, H., Hert, S.: The area partitioning problem. In: Proc. 12th Canadian Conf. on Computational Geometry (CCCG), pp. 163\u2013171 (2000)"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Bereg, S.: Equipartitions of measures by 2-fans. Discrete and Computational Geometry, pp. 87\u201396 (2005)","DOI":"10.1007\/s00454-004-1151-1"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Bespamyatnikh, S., Kirkpatrick, D., Snoeyink, J.: Generalizing ham sandwich cuts to equitable subdivisions. Discrete and Computational Geometry, pp. 605\u2013622 (2000)","DOI":"10.1007\/s4540010065"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/978-3-540-44400-8_7","volume-title":"Discrete and Computational Geometry","author":"S. Bespamyatnikh","year":"2003","unstructured":"Bespamyatnikh, S.: On partitioning a cake. In: Akiyama, J., Kano, M. (eds.) JCDCG 2002. LNCS, vol.\u00a02866, pp. 60\u201371. Springer, Heidelberg (2003)"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Beyer, W.A., Zardecki, A.: The early history of the ham sandwich theorem. American Mathematical Monthly, pp. 58\u201361 (2004)","DOI":"10.1080\/00029890.2004.11920050"},{"key":"13_CR12","unstructured":"Carlsson, J.G., Armbruster, B., Ye, Y.: Finding equitable convex partitions of points in a polygon (Unpublished manuscript, 2007)"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1023\/A:1016639210559","volume":"31","author":"H. Choset","year":"2001","unstructured":"Choset, H.: Coverage for robotics - a survey of recent results. Annals of Mathematics and Artificial Intelligence\u00a031, 113\u2013126 (2001)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"13_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03427-9","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"1997","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer, Heidelberg (1997)"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Fox, D., Ko, J., Konolige, K., Limketkai, B., Schulz, D., Stewart, B.: Distributed multi-robot exploration and mapping. In: Proc. IEEE 2006 (2006)","DOI":"10.1109\/JPROC.2006.876927"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1142\/S0218195998000230","volume":"8","author":"S. Hert","year":"1998","unstructured":"Hert, S., Lumelsky, V.J.: Polygon area decomposition for multiple-robot workspace division. International Journal of Computational Geometry and Applications\u00a08, 437\u2013466 (1998)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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 ham 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":"13_CR18","unstructured":"Steinhaus, H., et al.: A note on the ham sandwich theorem. Mathesis Polska, pp. 26\u201328 (1938)"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11603771_1","volume-title":"Distributed Computing \u2013 IWDC 2005","author":"D. Peleg","year":"2005","unstructured":"Peleg, D.: Distributed coordination algorithms for mobile robot swarms: New directions and challenges. In: Pal, A., Kshemkalyani, A.D., Kumar, R., Gupta, A. (eds.) IWDC 2005. LNCS, vol.\u00a03741, pp. 1\u201312. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69355-0_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:57:45Z","timestamp":1605743865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69355-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540693260","9783540693550"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69355-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}