{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:08:19Z","timestamp":1725664099018},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540582182"},{"type":"electronic","value":"9783540485773"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58218-5_29","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:37:45Z","timestamp":1330270665000},"page":"314-325","source":"Crossref","is-referenced-by-count":0,"title":["An O(log log n) algorithm to compute the kernel of a polygon"],"prefix":"10.1007","author":[{"given":"S.","family":"Schuierer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"M. J. Atallah and D. Z. Chen. Optimal parallel algorithm for visibility of a simple polygon from a point. In Proc. 5th ACM Symp. on Computational Geometry, pages 114\u2013123, 1989.","DOI":"10.1145\/73833.73846"},{"key":"29_CR2","unstructured":"O. Berkman, B. Schieber, and U. Vishkin. Some Doubly Logarithmic Optimal Parallel Algorithms Based on Finding All Nearest Smaller Values. Technical Report UMIACS-TR-88-79, Institute for Advance Computer Studies, University of Maryland, 1988."},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"D. Z. Chen. An optimal parallel algorithm for detecting weak visibility of a simple polygon. In Proc. 8th ACM Symp. on Computational Geometry, pages 63\u201372, 1992.","DOI":"10.1145\/142675.142692"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"R. Cole and M. Goodrich. Optimal parallel algorithms for polygon and point-set problems. In Proc. 4th ACM Symp. on Computational Geometry, pages 201\u2013210, 1988.","DOI":"10.1145\/73393.73414"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Herbert Edelsbrunner. Algorithms in Combinatorial Geometry. Springer Verlag, EATCS monographs on theoretical computer science, 1987.","DOI":"10.1007\/978-3-642-61568-9"},{"issue":"3","key":"29_CR6","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1145\/322139.322142","volume":"26","author":"D. T. Lee","year":"1979","unstructured":"D. T. Lee and F. P. Preparata. An optimal algorithm for finding the kernel of a polygon. Journal of the ACM, 26(3):415\u2013421, July 1979.","journal-title":"Journal of the ACM"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"P. Ragde. The parallel simplicity of compaction and chaining. In Proc. 17th Intern. Colloq. on Automata, Languages, and Programming, pages 744\u2013751, 1990.","DOI":"10.1007\/BFb0032071"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"H. Wagener. Optimal parallel hull construction for simple polygons in O(log log n) time. In Proc. 33rd IEEE Symp. on Foundations of Computer Science, pages 593\u2013599, 1992.","DOI":"10.1109\/SFCS.1992.267792"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT '94"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58218-5_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:18:49Z","timestamp":1605647929000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58218-5_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540582182","9783540485773"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-58218-5_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}