{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T03:12:11Z","timestamp":1778814731594,"version":"3.51.4"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1990,6]]},"DOI":"10.1007\/bf01840405","type":"journal-article","created":{"date-parts":[[2005,6,28]],"date-time":"2005-06-28T22:41:35Z","timestamp":1119998495000},"page":"573-590","source":"Crossref","is-referenced-by-count":15,"title":["An optimal algorithm for the boundary of a cell in a union of rays"],"prefix":"10.1007","volume":"5","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","reference":[{"key":"BF01840405_CR1","doi-asserted-by":"crossref","unstructured":"P. Alevizos, J. D. Boissonnat, and M. Yvinec: An OptimalO(n logn) Algorithm for Contour Reconstruction from Rays,Proc. 3rd ACM Symposium on Computational Geometry, Waterloo, pp. 162\u2013170, June 1987.","DOI":"10.1145\/41958.41975"},{"key":"BF01840405_CR2","doi-asserted-by":"crossref","unstructured":"M. Atallah: Dynamic Computational Geometry,Proc. 24th IEEE Symposium on Foundations of Computer Science, pp. 92\u201399, Oct. 1983.","DOI":"10.1109\/SFCS.1983.13"},{"key":"BF01840405_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, pp. 135\u2013147, June 1985.","DOI":"10.1145\/323233.323252"},{"key":"BF01840405_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"},{"key":"BF01840405_CR5","doi-asserted-by":"crossref","unstructured":"H. Edelsbrunner, L. J. Guibas, and M. Sharir: The Complexity of Many Faces in Arrangements of Lines and Segments,Proc. 4th ACM Symposium on Computational Geometry, Urbana, pp. 44\u201356, June 1988.","DOI":"10.1145\/73393.73399"},{"key":"BF01840405_CR6","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 Hyper-planes with Applications,SIAM J. Comput. 15, 341\u2013363 (1986).","journal-title":"SIAM J. Comput."},{"key":"BF01840405_CR7","doi-asserted-by":"crossref","unstructured":"L. J. Guibas, M. Sharir, and S. Sifrony: On the General Motion Planning Problem with Two Degrees of Freedom,Proc. 4th ACM Symposium on Computational Geometry, Urbana, pp. 319\u2013329, June 1988.","DOI":"10.1145\/73393.73423"},{"issue":"2","key":"BF01840405_CR8","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":"BF01840405_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 Comput. Geom. 3, 123\u2013136 (1988).","journal-title":"Discrete Comput. Geom."},{"key":"BF01840405_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-Schinzel Sequences by Segments,Discrete Comput. Geom. 3, 15\u201347 (1988).","journal-title":"Discrete Comput. Geom."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01840405.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01840405\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01840405","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T01:38:27Z","timestamp":1586309907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01840405"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":10,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["BF01840405"],"URL":"https:\/\/doi.org\/10.1007\/bf01840405","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}