On the minimum size of visibility graphs |
| |
| Authors: | Alfredo Garc?& #x a OlaverriFerran Hurtado,Marc NoyJavier Tejel |
| |
| Affiliation: | a Universidad de Zaragoza, Departamento de Métodos Estad?́sticos, Zaragoza, Spain
b Universitat Politècnica de Catalunya, Departament de Matemàtica Aplicada II, Pau Gargallo, 5, 08028 Barcelona, Spain |
| |
| Abstract: | In this paper we give tight lower bounds on the size of the visibility graph, the contracted visibility graph, and the bar-visibility graph of n disjoint line segments in the plane, according to their vertex-connectivity. |
| |
| Keywords: | Combinatorial problems Computational geometry Visibility graph Lower bound |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
