--- res: bibo_abstract: - 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.@eng bibo_authorlist: - foaf_Person: foaf_givenName: Herbert foaf_name: Edelsbrunner, Herbert foaf_surname: Edelsbrunner foaf_workInfoHomepage: http://www.librecat.org/personId=3FB178DA-F248-11E8-B48F-1D18A9856A87 orcid: 0000-0002-9823-6833 - foaf_Person: foaf_givenName: Xiaojun foaf_name: Shen, Xiaojun foaf_surname: Shen bibo_doi: 10.1016/0020-0190(87)90038-X bibo_issue: '2' bibo_volume: 26 dct_date: 1987^xs_gYear dct_isPartOf: - http://id.crossref.org/issn/0020-0190 - http://id.crossref.org/issn/1872-6119 dct_language: eng dct_publisher: Elsevier@ dct_title: A tight lower bound on the size of visibility graphs@ ...