{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T04:41:17Z","timestamp":1771562477791,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1986,11,1]],"date-time":"1986-11-01T00:00:00Z","timestamp":531187200000},"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":[[1986,11]]},"DOI":"10.1007\/bf01840436","type":"journal-article","created":{"date-parts":[[2005,7,13]],"date-time":"2005-07-13T21:29:13Z","timestamp":1121290153000},"page":"49-63","source":"Crossref","is-referenced-by-count":166,"title":["Visibility of disjoint polygons"],"prefix":"10.1007","volume":"1","author":[{"given":"Takao","family":"Asano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tetsuo","family":"Asano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonidas","family":"Guibas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Hershberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Imai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01840436_CR1","first-page":"557","volume":"E-68","author":"T. Asano","year":"1985","unstructured":"T. Asano, An efficient algorithms for finding the visibility polygons for a polygonal region with holes.Transaction of IECE of Japan, Vol. E-68 (1985), pp. 557\u2013559.","journal-title":"Transaction of IECE of Japan"},{"key":"BF01840436_CR2","unstructured":"K. Q. Brown, Geometric transforms for fast geometric algorithms. Ph.D. thesis, Department of Computer Science, Carnegie-Mellon University, 1980."},{"key":"BF01840436_CR3","doi-asserted-by":"crossref","unstructured":"B. Chazelle, Filtering search: a new approach to query-answering.Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, Tucson, 1983, pp. 122\u2013132.","DOI":"10.1109\/SFCS.1983.17"},{"key":"BF01840436_CR4","doi-asserted-by":"crossref","unstructured":"B. Chazelle, L. J. Guibas and D. T. Lee, The power of geometric duality.Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, Tucson, 1983, pp. 217\u2013225; also,BIT, Vol. 25 (1985), pp. 76\u201390.","DOI":"10.1007\/BF01934990"},{"key":"BF01840436_CR5","doi-asserted-by":"crossref","unstructured":"H. Edelsbrunner, J. O'Rourke and R. Seidel, Constructing arrangements of lines and hyperplanes with applications.Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, Tucson, 1983, pp. 83\u201391.","DOI":"10.1109\/SFCS.1983.11"},{"key":"BF01840436_CR6","unstructured":"H. Edelsbrunner, M. H. Overmars and D. Wood, Graphics in flatland: a case study. InAdvances in Computing Research (F. P. Preparata, ed.), Vol. 1, JAI Press Inc., 1983, pp. 35\u201359."},{"key":"BF01840436_CR7","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/0196-6774(81)90019-5","volume":"2","author":"H. Gindy El","year":"1981","unstructured":"H. El Gindy and D. Avis, A linear algorithm for computing the visibility polygon from a point.Journal of Algorithms, Vol. 2 (1981), pp. 186\u2013197.","journal-title":"Journal of Algorithms"},{"key":"BF01840436_CR8","unstructured":"H. A. El Gindy and G. T. Toussaint, Efficient algorithms for inserting and deleting edges from triangulations. Manuscript, School of Computer Science, McGill University, 1984."},{"key":"BF01840436_CR9","doi-asserted-by":"crossref","unstructured":"H. N. Gabow and R. E. Tarjan, A linear-time algorithm for a special case of disjoint set union.Proceedings of the 15th Annual ACM Symposium on Theory of Computing, Boston, 1983, pp. 246\u2013251; also,Journal of Computer and System Sciences, Vol. 30 (1985), pp. 209\u2013221.","DOI":"10.1016\/0022-0000(85)90014-5"},{"issue":"No. 4","key":"BF01840436_CR10","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(78)90062-5","volume":"7","author":"M. R. Garey","year":"1978","unstructured":"M. R. Garey, D. S. Johnson, F. P. Preparata and R. E. Tarjan, Triangulating a simple polygon.Information Processing Letters, Vol. 7, No. 4 (1978), pp. 175\u2013179.","journal-title":"Information Processing Letters"},{"key":"BF01840436_CR11","doi-asserted-by":"crossref","unstructured":"D. Harel, A linear time algorithm for the lowest common ancestors problem.Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science, Syracuse, N.Y., 1980, pp. 308\u2013319.","DOI":"10.1109\/SFCS.1980.6"},{"key":"BF01840436_CR12","unstructured":"D. T. Lee, Proximity and reachability in the plane. Ph.D. dissertation, University of Illinois at Urbana-Champaign, 1978."},{"key":"BF01840436_CR13","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0734-189X(83)90065-8","volume":"22","author":"D. T. Lee","year":"1983","unstructured":"D. T. Lee, Visibility of a simple polygon.Computer Vision, Graphics, and Image Processing, Vol. 22 (1983), pp. 207\u2013221.","journal-title":"Computer Vision, Graphics, and Image Processing"},{"key":"BF01840436_CR14","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/net.3230140304","volume":"14","author":"D. T. Lee","year":"1984","unstructured":"D. T. Lee and F. P. Preparata, Euclidean shortest paths in the presence of rectilinear barriers,Networks, Vol. 14 (1984), pp. 393\u2013410.","journal-title":"Networks"},{"key":"BF01840436_CR15","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/359156.359164","volume":"22","author":"T. Lozano-Perez","year":"1979","unstructured":"T. Lozano-Perez and M. A. Wesley, An algorithm for planning collision-free paths among polyhedral obstacles.Comm. ACM, Vol. 22 (1979), pp. 560\u2013570.","journal-title":"Comm. ACM"},{"key":"BF01840436_CR16","doi-asserted-by":"crossref","unstructured":"M. Sharir and A. Schoorr, On shortest paths in polyhedral spaces.Proceedings of the 16th Annual ACM Symposium on Theory of Computing, Washington, D.C., 1984, pp. 144\u2013153.","DOI":"10.1145\/800057.808676"},{"key":"BF01840436_CR17","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0020-0190(85)90044-4","volume":"20","author":"E. Welzl","year":"1985","unstructured":"E. Welzl, Constructing the visibility graph forn line segments inO(n 2) time.Information Processing Letters, Vol. 20 (1985), pp. 167\u2013171.","journal-title":"Information Processing Letters"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01840436.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01840436\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01840436","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T19:35:31Z","timestamp":1557430531000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01840436"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,11]]},"references-count":17,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1986,11]]}},"alternative-id":["BF01840436"],"URL":"https:\/\/doi.org\/10.1007\/bf01840436","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,11]]}}}