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