{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:59Z","timestamp":1725664079687},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540582182"},{"type":"electronic","value":"9783540485773"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58218-5_10","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:36:51Z","timestamp":1330270611000},"page":"107-118","source":"Crossref","is-referenced-by-count":0,"title":["Separating translates in the plane: Combinatorial bounds and an algorithm"],"prefix":"10.1007","author":[{"given":"Jurek","family":"Czyzowicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hazel","family":"Everett","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Marc","family":"Robert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF02187724","volume":"4","author":"N. Alon","year":"1989","unstructured":"N. Alon, M. Katchalski, and W. Pulleyblank. Cutting disjoint disks by straight lines. Disc. Comp. Geom., 4:239\u2013243, 1989.","journal-title":"Disc. Comp. Geom."},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1016\/0898-1221(85)90105-1","volume":"11","author":"M. Atallah","year":"1985","unstructured":"M. Atallah. Some dynamic computational geometry problems. Comp. Math. Appl., 11:1171\u20131181, 1985.","journal-title":"Comp. Math. Appl."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"B. Chazelle, H. Edelsbrunner, M. Gringi, L. J. Guibas, M. Sharir, and J. Snoeyink. Ray shooting in polygons using geodesic triangulations. In Proc. of the 18th Int. Coll. on Automata, Languages and Programming, pages 661\u2013673, 1991.","DOI":"10.1007\/3-540-54233-7_172"},{"key":"10_CR4","unstructured":"J. Czyzowicz, E. Rivera-Campo, and J. Urrutia. A note on separation of convex sets. To appear in Disc. Math."},{"key":"10_CR5","unstructured":"J. Czyzowicz, E. Rivera-Campo, J. Urrutia, and J. Zaks. Separating convex sets in the plane. In Proc. of the Sec. Can. Conf. on Comp. Geom., pages 50\u201354, 1990."},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF02187835","volume":"7","author":"J. Czyzowicz","year":"1992","unstructured":"J. Czyzowicz, E. Rivera-Campo, J. Urrutia, and J. Zaks. Separating convex sets in the plane. Disc. Comp. Geom., 7:189\u2013195, 1992.","journal-title":"Disc. Comp. Geom."},{"key":"10_CR7","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/BF01934440","volume":"22","author":"H. Edelsbrunner","year":"1982","unstructured":"H. Edelsbrunner, H.A. Maurer, F.P. Preparata, A.L. Rosenberg, E. Welzl, and D. Wood. Stabbing line segments. BIT, 22:274\u2013281, 1982.","journal-title":"BIT"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"H. Everett, J.-M. Robert, and M. van Kreveld. An optimal algorithm for the (\u2264 k)-levels, with applications to separation and transversal. In Proc. of the 9th Annual ACM Symp. on Comp. Geom., pages 38\u201346, 1993.","DOI":"10.1145\/160985.160994"},{"key":"10_CR9","doi-asserted-by":"crossref","first-page":"44","DOI":"10.7146\/math.scand.a-12291","volume":"66","author":"R. Hope","year":"1990","unstructured":"R. Hope and M. Katchalski. Separating plane convex sets. Math. Scand., 66:44\u201346, 1990.","journal-title":"Math. Scand."},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0012-365X(87)90057-4","volume":"65","author":"M. Katchalski","year":"1987","unstructured":"M. Katchalski, T. Lewis, and A. Liu. Geometric permutations of disjoint translates of convex sets. Disc. Math., 65:249\u2013259, 1987.","journal-title":"Disc. Math."},{"key":"10_CR11","unstructured":"T. Nishizeki and N. Chiba. Planar Graphs: Theory and Algorithms. North-Holland, 1988."}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT '94"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58218-5_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:18:43Z","timestamp":1605647923000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58218-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540582182","9783540485773"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-58218-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}