{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T10:26:23Z","timestamp":1791109583323,"version":"4.1.0"},"reference-count":16,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1991,10]]},"abstract":"<jats:p>The visibility graph of a set of nonintersecting polygonal obstacles in the plane is an undirected graph whose vertex set consists of the vertices of the obstacles and whose edges are pairs of vertices $(u,v)$ such that the open line segment between u and v does not intersect any of the obstacles. The visibility graph is an important combinatorial structure in computational geometry and is used in applications such as solving visibility problems and computing shortest paths. This paper presents an algorithm that computes the visibility graph of a set of obstacles in time $O(E + n\\log n)$, where E is the number of edges in the visibility graph and n is the total number of vertices in all the obstacles.<\/jats:p>","DOI":"10.1137\/0220055","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:34:57Z","timestamp":1109226897000},"page":"888-910","source":"Crossref","is-referenced-by-count":161,"title":["An Output-Sensitive Algorithm for Computing Visibility Graphs"],"prefix":"10.1137","volume":"20","author":[{"given":"Subir Kumar","family":"Ghosh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David M.","family":"Mount","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840436"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90014-5"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"S. K. Ghosh, D. M. Mount,  An output sensitive algorithm for computing visibility graphs,  Proc. 28th Annual IEEE Symposium on Foundations of Computer Science, Los Angeles, CA,  1987,  11\u201319","DOI":"10.1109\/SFCS.1987.6"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840360"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01553883"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1137\/0202024"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"S. Kapoor, S. N. Maheshwari,  Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstacles,  Proc. 4th ACM Symposium on Computational Geometry, Urbana, IL,  1988,  172\u2013182","DOI":"10.1145\/73393.73411"},{"key":"R9","unstructured":"D. T. Lee,  Proximity and reachability in the plane, Ph.D. thesis and Tech. Report, ACT-12, Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL,  1978"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140304"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1145\/359156.359164"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69672-5"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69900-9"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"M. H. Overmars, E. Welzl,  New methods for constructing visibility graphs,  Proc. 4th ACM Symposium on Computational Geometry, Urbana, IL,  1988,  164\u2013171","DOI":"10.1145\/73393.73410"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1137\/0215014"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(85)90044-4"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0220055","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:52:07Z","timestamp":1787338327000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0220055"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,10]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1991,10]]}},"alternative-id":["10.1137\/0220055"],"URL":"https:\/\/doi.org\/10.1137\/0220055","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,10]]}}}