{"publication":"Information Processing Letters","quality_controlled":"1","date_published":"1987-10-19T00:00:00Z","publication_identifier":{"issn":["0020-0190"],"eissn":["1872-6119"]},"main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/002001908790038X?via%3Dihub"}],"status":"public","day":"19","citation":{"chicago":"Edelsbrunner, Herbert, and Xiaojun Shen. “A Tight Lower Bound on the Size of Visibility Graphs.” <i>Information Processing Letters</i>. Elsevier, 1987. <a href=\"https://doi.org/10.1016/0020-0190(87)90038-X\">https://doi.org/10.1016/0020-0190(87)90038-X</a>.","ama":"Edelsbrunner H, Shen X. A tight lower bound on the size of visibility graphs. <i>Information Processing Letters</i>. 1987;26(2):61-64. doi:<a href=\"https://doi.org/10.1016/0020-0190(87)90038-X\">10.1016/0020-0190(87)90038-X</a>","ieee":"H. Edelsbrunner and X. Shen, “A tight lower bound on the size of visibility graphs,” <i>Information Processing Letters</i>, vol. 26, no. 2. Elsevier, pp. 61–64, 1987.","ista":"Edelsbrunner H, Shen X. 1987. A tight lower bound on the size of visibility graphs. Information Processing Letters. 26(2), 61–64.","mla":"Edelsbrunner, Herbert, and Xiaojun Shen. “A Tight Lower Bound on the Size of Visibility Graphs.” <i>Information Processing Letters</i>, vol. 26, no. 2, Elsevier, 1987, pp. 61–64, doi:<a href=\"https://doi.org/10.1016/0020-0190(87)90038-X\">10.1016/0020-0190(87)90038-X</a>.","apa":"Edelsbrunner, H., &#38; Shen, X. (1987). A tight lower bound on the size of visibility graphs. <i>Information Processing Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/0020-0190(87)90038-X\">https://doi.org/10.1016/0020-0190(87)90038-X</a>","short":"H. Edelsbrunner, X. Shen, Information Processing Letters 26 (1987) 61–64."},"scopus_import":"1","doi":"10.1016/0020-0190(87)90038-X","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng","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."}],"publist_id":"2025","publisher":"Elsevier","issue":"2","language":[{"iso":"eng"}],"article_processing_charge":"No","date_created":"2018-12-11T12:06:54Z","volume":26,"page":"61 - 64","month":"10","date_updated":"2022-02-03T14:05:19Z","_id":"4094","title":"A tight lower bound on the size of visibility graphs","author":[{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner"},{"first_name":"Xiaojun","full_name":"Shen, Xiaojun","last_name":"Shen"}],"type":"journal_article","year":"1987","oa_version":"None","publication_status":"published","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.","article_type":"original","intvolume":"        26","extern":"1"}