{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:12:23Z","timestamp":1778249543143,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540602163","type":"print"},{"value":"9783540447337","type":"electronic"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0030820","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T03:51:40Z","timestamp":1133409100000},"page":"61-70","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Rectangulating rectilinear polygons in parallel"],"prefix":"10.1007","author":[{"given":"Sung Kwon","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1137\/0218035","volume":"18","author":"M.J. Atallah","year":"1989","unstructured":"M.J. Atallah, R. Cole, and M.T. Goodrich, Cascading divide-and-conquer: A technique for designing parallel algorithms, SIAM J. Comput., 18 (1989) 499\u2013532.","journal-title":"SIAM J. Comput."},{"key":"7_CR2","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1007\/3-540-54233-7_172","volume":"510","author":"B. Chazelle","year":"1991","unstructured":"B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, J. Hershberger, M. Sharir, and J. Snoeyink, Ray shooting in polygons using geodesic triangulations, Proc. 18th ICALP, Lecture Notes in Computer Science, vol. 510, pp. 661\u2013673, 1991.","journal-title":"Lecture Notes in Computer Science"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0020-0190(94)90129-5","volume":"52","author":"M. de Berg","year":"1994","unstructured":"M. de Berg and M. van Kreveld, Rectilinear decompositions with low stabbing number, Information Processing Letters, 52 (1994) 215\u2013221.","journal-title":"Information Processing Letters"},{"key":"7_CR4","unstructured":"J. Hershberger and S. Suri, A pedestrian approach to ray shooting: Shoot a ray, take a walk, Proc. 4th SODA, pp. 54\u201363, 1993."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030820","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:23:49Z","timestamp":1778246629000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0030820"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602163","9783540447337"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/bfb0030820","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"20 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}