{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:57:51Z","timestamp":1725663471318},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540518150"},{"type":"electronic","value":"9783540468158"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51815-0_43","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:18:03Z","timestamp":1330186683000},"page":"65-71","source":"Crossref","is-referenced-by-count":0,"title":["A parallel algorithm for the visibility problem inside a simple polygon"],"prefix":"10.1007","author":[{"given":"Paola","family":"Bertolazzi","sequence":"first","affiliation":[]},{"given":"Concettina","family":"Guerra","sequence":"additional","affiliation":[]},{"given":"Silvio","family":"Salza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"A. Aggarwal, B. Chazelle, L. Guibas, C. O'Dunlaing and C. Yap, \u201dParallel Computational geometry\u201d, Proc. 26th FOCS, 468\u2013477, 1985.","DOI":"10.1109\/SFCS.1985.42"},{"key":"8_CR2","first-page":"557","volume":"E-68","author":"T. Asano","year":"1985","unstructured":"T. Asano, \u201dAn efficient algorithm for finding the visibility polygon for a polygonal region with holes\u201d, Trans. IECE-Japan, E-68, 557\u2013559, 1985.","journal-title":"Trans. IECE-Japan"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0167-8191(88)90085-3","volume":"6","author":"T. Asano","year":"1988","unstructured":"T. Asano, H. Umeo, \u201dSystolic algorithms for computing the visibility polygon and triangulation of a polygonal region\u201d, Parallel Computing, 6, 209\u2013217, 1988.","journal-title":"Parallel Computing"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1016\/0743-7315(86)90011-0","volume":"3","author":"M. Atallah","year":"1986","unstructured":"M. Atallah, M. T. Goodrich, \u201dEfficient solutions to some geometric problems\u201d, Journal of Parallel and Distributed Computing, 3, 492\u2013507, 1986.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/0196-6774(81)90019-5","volume":"2","author":"H. E. Gindy","year":"1981","unstructured":"H. E. Gindy, D. Avis, \u201dA linear algorithm for computing the visibility polygon from a point\u201d, Journal of Algorithms, 2, 186\u2013197, 1981.","journal-title":"Journal of Algorithms"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"R. E. Ladner, M. J. Fischer, \u201dParallel prefix computation\u201d, Journal ACM, 831\u2013838, 1980.","DOI":"10.1145\/322217.322232"},{"key":"8_CR7","unstructured":"E. Lodi, L. Pagli, \u201dA VLSI algorithm for a visibility problem\u201d, VLSI: Algorithms and Architectures, (P. Bertolazzi and F. Luccio eds.), North-Holland, 125\u2013136, 1985."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"L. G. Valiant, \u201dParallelism on comparison problems\u201d, SIAM Journal on Computing, 348\u2013355, 1975.","DOI":"10.1137\/0204030"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0020-0190(87)90093-7","volume":"25","author":"C. A. Wang","year":"1987","unstructured":"C. A. Wang, Y. H. Tsin, \u201dAn O(log n) time parallel algorithm for triangulating a set of points in the plane\u201d, Information Processing Letters, 25, 55\u201360, 1987.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Recent Issues in Pattern Analysis and Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51815-0_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:05:46Z","timestamp":1619557546000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51815-0_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540518150","9783540468158"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-51815-0_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}