{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T22:55:43Z","timestamp":1762296943460},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"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":[[1990,6]]},"DOI":"10.1007\/bf01840385","type":"journal-article","created":{"date-parts":[[2005,6,28]],"date-time":"2005-06-28T18:41:35Z","timestamp":1119984095000},"page":"201-214","source":"Crossref","is-referenced-by-count":3,"title":["A fast algorithm for computing sparse visibility graphs"],"prefix":"10.1007","volume":"5","author":[{"given":"S.","family":"Sudarshan","sequence":"first","affiliation":[]},{"given":"C.","family":"Pandu Rangan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01840385_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"A. V. Aho, J. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974."},{"key":"BF01840385_CR2","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF01840436","volume":"1","author":"T. Asano","year":"1986","unstructured":"T. Asano, T. Asano, L. Guibas, J. Hershberger, and H. Imai, Visibility of disjoint polygons,Algorithmica,1 (1986), 49\u201363.","journal-title":"Algorithmica"},{"key":"BF01840385_CR3","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,22 (1979), 560\u2013570.","journal-title":"Comm. ACM"},{"key":"BF01840385_CR4","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/0022-0000(81)90012-X","volume":"23","author":"M. H. Overmars","year":"1981","unstructured":"M. H. Overmars and J. Van Leeuwen, Maintenance of configurations in the plane,J. Comput. System Sci,23 (1981), 166\u2013204.","journal-title":"J. Comput. System Sci"},{"key":"BF01840385_CR5","series-title":"B. Tech. Project Report","volume-title":"A fast algorithm for computing sparse visibility graphs","author":"S. Sudarshan","year":"1987","unstructured":"S. Sudarshan, A fast algorithm for computing sparse visibility graphs, B. Tech. Project Report, Dept. of Comput. Sci and Engg., IIT, Madras-36, June, 1987."},{"key":"BF01840385_CR6","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,Inform. Process. Lett.,20 (1985), 167\u2013171.","journal-title":"Inform. Process. Lett."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01840385.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01840385\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01840385","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T15:35:31Z","timestamp":1557416131000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01840385"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":6,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["BF01840385"],"URL":"https:\/\/doi.org\/10.1007\/bf01840385","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}