[{"year":"1987","publication":"Information Processing Letters","day":"19","page":"61 - 64","date_created":"2018-12-11T12:06:54Z","date_published":"1987-10-19T00:00:00Z","doi":"10.1016/0020-0190(87)90038-X","acknowledgement":"Research of this author ‘was supported by the Amoco Foundation for Facilitation of Development of Computer\r\nScience under Grant No. l-6-44862.","publisher":"Elsevier","quality_controlled":"1","citation":{"mla":"Edelsbrunner, Herbert, and Xiaojun Shen. “A Tight Lower Bound on the Size of Visibility Graphs.” Information Processing Letters, vol. 26, no. 2, Elsevier, 1987, pp. 61–64, doi:10.1016/0020-0190(87)90038-X.","ama":"Edelsbrunner H, Shen X. A tight lower bound on the size of visibility graphs. Information Processing Letters. 1987;26(2):61-64. doi:10.1016/0020-0190(87)90038-X","apa":"Edelsbrunner, H., & Shen, X. (1987). A tight lower bound on the size of visibility graphs. Information Processing Letters. Elsevier. https://doi.org/10.1016/0020-0190(87)90038-X","ieee":"H. Edelsbrunner and X. Shen, “A tight lower bound on the size of visibility graphs,” Information Processing Letters, vol. 26, no. 2. Elsevier, pp. 61–64, 1987.","short":"H. Edelsbrunner, X. Shen, Information Processing Letters 26 (1987) 61–64.","chicago":"Edelsbrunner, Herbert, and Xiaojun Shen. “A Tight Lower Bound on the Size of Visibility Graphs.” Information Processing Letters. Elsevier, 1987. https://doi.org/10.1016/0020-0190(87)90038-X.","ista":"Edelsbrunner H, Shen X. 1987. A tight lower bound on the size of visibility graphs. Information Processing Letters. 26(2), 61–64."},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","author":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"full_name":"Shen, Xiaojun","last_name":"Shen","first_name":"Xiaojun"}],"publist_id":"2025","title":"A tight lower bound on the size of visibility graphs","publication_status":"published","publication_identifier":{"eissn":["1872-6119"],"issn":["0020-0190"]},"language":[{"iso":"eng"}],"volume":26,"issue":"2","abstract":[{"text":"The visibility graph of a finite set of line segments in the plane connects two endpoints u and v if and only if the straight line connection between u and v does not cross any line segment of the set. This article proves that 5n - 4 is a lower bound on the number of edges in the visibility graph of n nonintersecting line segments in the plane. This bound is tight.","lang":"eng"}],"oa_version":"None","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/002001908790038X?via%3Dihub"}],"scopus_import":"1","intvolume":" 26","month":"10","date_updated":"2022-02-03T14:05:19Z","extern":"1","_id":"4094","type":"journal_article","article_type":"original","status":"public"}]