{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:35Z","timestamp":1725663395494},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540516835"},{"type":"electronic","value":"9783540467489"}],"license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"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":[[1989]]},"DOI":"10.1007\/3-540-51683-2_34","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:11:44Z","timestamp":1330204304000},"page":"247-274","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An optimal algorithm for the boundary of a cell in a union of rays"],"prefix":"10.1007","author":[{"given":"Panagiotis","family":"Alevizos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Daniel","family":"Boissonnat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franco P.","family":"Preparata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"M. Atallah: Dynamic Computational Geometry, Proc. 24th IEEE Symp. on Foundations of Computer Science, 92\u201399; Oct. 1983.","DOI":"10.1109\/SFCS.1983.13"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"P. Alevizos, J.D. Boissonnat, and M. Yvinec: An optimal O(n log n) Algorithm for Contour Reconstruction from Rays, Proc. 3rd ACM Symposium on Computational Geometry, Waterloo, 162\u2013170; June 1987.","DOI":"10.1145\/41958.41975"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"B. Chazelle and L. Guibas: Visibility and Intersection Problems in Plane Geometry, Proc. 1st ACM Symposium on Computational Geometry, Baltimore, 135\u2013147; June 1985.","DOI":"10.1145\/323233.323252"},{"key":"14_CR4","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/BF01934990","volume":"25","author":"B. Chazelle","year":"1985","unstructured":"B. Chazelle, L. Guibas, and D.T. Lee: The Power of Geometric Duality, BIT 25, 76\u201390; (1985).","journal-title":"BIT"},{"issue":"2","key":"14_CR5","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02579170","volume":"6","author":"S. Hart","year":"1986","unstructured":"S. Hart and M. Sharir: Non Linearity of Davenport-Schinzel Sequences and of Generalized Path Compression Schemes, Combinatorica 6(2), 151\u2013177 (1986).","journal-title":"Combinatorica"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"H. Edelsbrunner, L.J. Guibas, and M. Sharir: The Complexity of Many Faces in Arrangements of Lines and Segments, Prof. 4th ACM Symposium on Computational Geometry, Urbana, 44\u201356; June 1988.","DOI":"10.1145\/73393.73399"},{"key":"14_CR7","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1137\/0215024","volume":"15","author":"H. Edelsbrunner","year":"1986","unstructured":"H. Edelsbrunner, J. O'Rourke, and R. Seidel: Constructing Arrangements of Lines and Hyperplanes with Applications, SIAM J. Comp. 15, 341\u2013363 (1986).","journal-title":"SIAM J. Comp."},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"L. J. Guibas, M. Sharir, and S. Sifrony: On the General Motion Planning Problem with Two Degrees of Freedom, Prof. 4th ACM Symposium on Computational Geometry, Urbana, 319\u2013329; June 1988.","DOI":"10.1145\/73393.73423"},{"key":"14_CR9","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF02187902","volume":"3","author":"R. Pollack","year":"1988","unstructured":"R. Pollack, M. Sharir, and S. Sifrony: Separating Two Simple Polygons by a Sequence of Translations, Discrete Comp. Geom. 3:123\u2013136 (1988).","journal-title":"Discrete Comp. Geom."},{"key":"14_CR10","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF02187894","volume":"3","author":"A. Wiernik","year":"1988","unstructured":"A. Wiernik and M. Sharir: Planar Realizations of Nonlinear Davenport \u2014 Schinzel Sequences by Segments, Discrete Comp. Geom. 3:15\u201347 (1988).","journal-title":"Discrete Comp. Geom."}],"container-title":["Lecture Notes in Computer Science","Geometry and Robotics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51683-2_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:29:20Z","timestamp":1558268960000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51683-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540516835","9783540467489"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-51683-2_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]},"assertion":[{"value":"31 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}