{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T04:04:36Z","timestamp":1648699476820},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"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":[[1995,9]]},"DOI":"10.1007\/bf01206329","type":"journal-article","created":{"date-parts":[[2005,2,25]],"date-time":"2005-02-25T13:24:38Z","timestamp":1109337878000},"page":"203-228","source":"Crossref","is-referenced-by-count":8,"title":["A linear-time algorithm for constructing a circular visibility diagram"],"prefix":"10.1007","volume":"14","author":[{"given":"Shuo-Yan","family":"Chou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. C.","family":"Woo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0218195993000026","volume":"3","author":"P. K. Agarwal","year":"1993","unstructured":"Agarwal, P. K., and M. Sharir, Circular visibility from a point in a simple polygon,Internat. J. Comput. Geom. Appl.,3(1), 1?25, 1993.","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1006\/jagm.1993.1004","volume":"14","author":"P. K. Agarwal","year":"1993","unstructured":"Agarwal, P. K., and M. Sharir, Circle shooting in a simple polygon,J. Algorithms,14, 69?87, 1993.","journal-title":"J. Algorithms"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1109\/TC.1981.1675729","volume":"30","author":"D. Avis","year":"1981","unstructured":"Avis, D., and G. T. Toussaint, An optimal algorithm for determining the visibility of a polygon from an edge,IEEE Trans. Comput.,30, 910?914, 1981.","journal-title":"IEEE Trans. Comput."},{"key":"CR4","volume-title":"Algebraic Geometry: A New Treatise on Analytical Conic Sections","author":"W. M. Baker","year":"1906","unstructured":"Baker, W. M.,Algebraic Geometry: A New Treatise on Analytical Conic Sections, Bell, London, 1906."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BF02574703","volume":"6","author":"B. M. Chazelle","year":"1991","unstructured":"Chazelle, B. M., Triangulating a simply polygon in linear time,Discrete Computat. Geom.,6, 485?524, 1991.","journal-title":"Discrete Computat. Geom."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/BF02187747","volume":"4","author":"B. M. Chazelle","year":"1989","unstructured":"Chazelle, B. M., and L. T. Guibas, Visibility and intersection problems in plane geometry,Discrete Comput. Geom.,4, 551?581, 1989.","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"CR7","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/BF01934990","volume":"25","author":"B. M. Chazelle","year":"1985","unstructured":"Chazelle, B. M., L. T. Guibas, and D. T. Lee, The power of geometric duality,BIT,25(1), 76?90, 1985.","journal-title":"BIT"},{"key":"CR8","unstructured":"Chou, S. Y., L. L. Chen, and T. C. Woo, Circular Visibility of a Simple Polygon, Working Paper 92-102, Department of Industrial and Manufacturing Systems Engineering, Iowa State University, 1992."},{"key":"CR9","unstructured":"Chou, S. Y., L. L. Chen, and T. C. Woo, Parabolic Visibility in the Plane, Working Paper 92-103, Department of Industrial and Manufacturing Systems Engineering, Iowa State University, 1992."},{"key":"CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"Edelsbrunner, H.,Algorithms in Combinatorial Geometry, Springer-Verlag, New York, 1987."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0022-0000(89)90038-X","volume":"38","author":"H. Edelsbrunner","year":"1989","unstructured":"Edelsbrunner, H., and L. J. Guibas, Topologically sweeping an arrangement,J. Comput. System Sci 38 165?194, 1989.","journal-title":"J. Comput. System Sci"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L. Guibas","year":"1987","unstructured":"Guibas, L., J. Hershberger, D. Leven, M. Sharir, and R. Tarjan, Linear-time visibility and shortest path problems inside triangulated simple polygons,Algorithmica,2, 209?233, 1987.","journal-title":"Algorithmica"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1007\/BF01937271","volume":"27","author":"B. Joe","year":"1987","unstructured":"Joe, B., and R. B. Simpson, Correction to Lee's visibility polygon algorithm,BIT 27 458?473, 1987.","journal-title":"BIT"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0734-189X(83)90065-8","volume":"22","author":"D. T. Lee","year":"1983","unstructured":"Lee, D. T., Visibility of a simple polygon,Comput. Vision Graphics Image process.,22, 207?221, 1983.","journal-title":"Comput. Vision Graphics Image process."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0020-0190(85)90015-8","volume":"21","author":"D. T. Lee","year":"1985","unstructured":"Lee, D. T., and Y. T. Ching, The power of geometric duality revisited,Inform. Process, Lett.,21, 117?122, 1985.","journal-title":"Inform. Process, Lett."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1145\/322139.322142","volume":"26","author":"D. T. Lee","year":"1979","unstructured":"Lee, D. T., and F. P. Preparata, An optimal algorithm for finding the kernel of a polygon,J. Assoc. Comput. Mach.,26, 415?421, 1979.","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR17","volume-title":"Art Gallery Theorems and Algorithms","author":"J. O'Rourke","year":"1987","unstructured":"O'Rourke, J.,Art Gallery Theorems and Algorithms, Oxford University Press, Oxford, 1987."},{"key":"CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F. Preparata","year":"1985","unstructured":"Preparata, F., and M. I. Shamos,Computational Geometry: An Introduction, Springer-Verlag, New York, 1985."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0734-189X(86)90127-1","volume":"35","author":"S. Suri","year":"1986","unstructured":"Suri, S., A linear time algorithm for minimum link paths inside a simply polygon,Comput. Vision Graphics Image Process.,35, 99?110, 1986.","journal-title":"Comput. Vision Graphics Image Process."},{"key":"CR20","doi-asserted-by":"crossref","unstructured":"Suri, S., and J. O'Rourke, Worst-case optimal algorithms for constructing visibility polygons with holes,Proc. 2nd ACM Symp. on Computational Geometry, Yorktown Heights, NY, 1986, pp. 14?23.","DOI":"10.1145\/10515.10517"},{"issue":"5","key":"CR21","first-page":"143","volume":"17","author":"R. E. Tarjan","year":"1985","unstructured":"Tarjan, R. E., and C. van Wyk, AnO(n) log log n-time algorithm for triangulating a simple polygon,SIAM J. Comput.,17(5), 143?178, 1985.","journal-title":"SIAM J. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01206329.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01206329\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01206329","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T17:10:11Z","timestamp":1556730611000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01206329"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["BF01206329"],"URL":"https:\/\/doi.org\/10.1007\/bf01206329","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}