{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T02:34:11Z","timestamp":1649039651337},"reference-count":3,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1993,5,1]],"date-time":"1993-05-01T00:00:00Z","timestamp":736214400000},"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":[[1993,5]]},"DOI":"10.1007\/bf01187038","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T12:11:10Z","timestamp":1108728670000},"page":"515-516","source":"Crossref","is-referenced-by-count":2,"title":["An addendum to parallel methods for visibility and shortest-path problems in simple polygons"],"prefix":"10.1007","volume":"9","author":[{"given":"Michael T.","family":"Goodrich","sequence":"first","affiliation":[]},{"given":"Steven B.","family":"Shauck","sequence":"additional","affiliation":[]},{"given":"Sumanta","family":"Guha","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"CR1","doi-asserted-by":"crossref","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(3), 1989, 499?532.","journal-title":"SIAM J. Comput."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/BF01758856","volume":"8","author":"M. T. Goodrich","year":"1992","unstructured":"M. T. Goodrich, S. Shauck, and S. Guha, Parallel Methods for Visibility and Shortest-Path Problems in Simple Polygons,Algorithmica,8, 1992, 461?486.","journal-title":"Algorithmica"},{"key":"CR3","unstructured":"C. R\u00fcb, Computing Intersections and Arrangements for Red-Blue Curve Segments in Parallel,Proc. 4th Canadian Conference on Computational Geometry, 1992, pp. 115?120."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01187038.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01187038\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01187038","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T12:35:44Z","timestamp":1556714144000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01187038"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,5]]},"references-count":3,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1993,5]]}},"alternative-id":["BF01187038"],"URL":"https:\/\/doi.org\/10.1007\/bf01187038","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,5]]}}}