{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:03:15Z","timestamp":1725663795102},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571551"},{"type":"electronic","value":"9783540479185"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57155-8_270","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T07:06:21Z","timestamp":1330239981000},"page":"452-463","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On fat partitioning, fat covering and the union size of polygons"],"prefix":"10.1007","author":[{"given":"Marc","family":"van Kreveld","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"42_CR1","unstructured":"Agarwal, P.K., and M. Sharir, Applications of a new partitioning scheme. Discr. & Comp. Geom., to appear."},{"key":"42_CR2","unstructured":"Alt, H., R. Fleischer, M. Kaufmann, K. Mehlhorn, S. N\u00e4her, S. Shirra, and C. Uhrig, Approximate motion planning and the complexity of the boundary of the union of simple geometric figures. Proc. 6th ACM Symp. Comp. Geom. (1990), pp. 281\u2013289."},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"Bose, J., M. van Kreveld, and G. Toussaint, Filling polyhedral molds. Tech. Rep. SOCS 93.1, School of Computer Science, McGill University, 1993. Extended abstract in these proceedings.","DOI":"10.1007\/3-540-57155-8_249"},{"key":"42_CR4","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/BF02187745","volume":"4","author":"H. Edelsbrunner","year":"1989","unstructured":"Edelsbrunner, H., L. Guibas, J. Hershberger, J. Pach, R. Pollack, R. Seidel, M. Sharir, and J. Snoeyink, On arrangements of Jordan arcs with three intersections per pair. Discr. & Comp. Geom.\n4 (1989), pp. 523\u2013539.","journal-title":"Discr. & Comp. Geom."},{"key":"42_CR5","unstructured":"Katz, M.J., M.H. Overmars, and M. Sharir, Efficient hidden surface removal for objects with small union size. Proc. 7th ACM Symp. Comp. Geom. (1991), pp. 31\u201340."},{"key":"42_CR6","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02187683","volume":"1","author":"K. Kedem","year":"1986","unstructured":"Kedem, K., R. Livne, J. Pach, and M. Sharir, On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discr. & Comp. Geom.\n1 (1986), pp. 59\u201371.","journal-title":"Discr. & Comp. Geom."},{"key":"42_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4022-9","volume-title":"Robot motion planning","author":"J.-C. Latombe","year":"1991","unstructured":"Latombe, J.-C., Robot motion planning. Kluwer Academic Publishers, Boston, 1991."},{"key":"42_CR8","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1109\/TPAMI.1982.4767267","volume":"4","author":"D.T. Lee","year":"1982","unstructured":"Lee, D.T., Medial axis transformation of a planar shape. IEEE Trans. Pattern Anal. Mach. Intel.\n4 (1982), pp. 363\u2013369.","journal-title":"IEEE Trans. Pattern Anal. Mach. Intel."},{"key":"42_CR9","unstructured":"Matou\u0161ek, J., N. Miller, J. Pach, M. Sharir, S. Sifrony, and E. Welzl, Fat triangles determine linearly many holes. Proc. 32nd IEEE Symp. Found. Comp. Science (1991), pp. 49\u201358."},{"key":"42_CR10","unstructured":"Miller, N., and M. Sharir, Efficient randomized algorithms for constructing the union of fat triangles and of pseudodiscs. Manuscript, 1993."},{"key":"42_CR11","unstructured":"Sharir, M., Efficient algorithms for planning purely translational collisionfree motion in two and three dimensions. Proc. IEEE Int. Conf. on Robotics and Automation (1987), pp. 1326\u20131331."},{"key":"42_CR12","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02187890","volume":"2","author":"C.K. Yap","year":"1987","unstructured":"Yap, C.K., An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments. Discr. & Comp. Geom.\n2 (1987), pp. 365\u2013393.","journal-title":"Discr. & Comp. Geom."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57155-8_270","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:19:45Z","timestamp":1578518385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57155-8_270"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571551","9783540479185"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-57155-8_270","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]},"assertion":[{"value":"9 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}