On the minimum size of visibility graphs

Authors:
Alfredo García Olaverri;Ferran Hurtado;Marc Noy;Javier Tejel
Affiliations:
Universidad de Zaragoza, Departamento de Métodos Estadísticos, Zaragoza, Spain;Universitat Politècnica de Catalunya, Department de Matemàtica Aplicada II, Pau Gargallo, 5, 08028 Barcelona, Spain;Universitat Politècnica de Catalunya, Department de Matemàtica Aplicada II, Pau Gargallo, 5, 08028 Barcelona, Spain;Universidad de Zaragoza, Departamento de Métodos Estadísticos, Zaragoza, Spain
Venue:
Information Processing Letters
Year:
2002

Citing 5
Cited 0

A tight lower bound on the size of visibility graphs

Information Processing Letters
A note on visibility graphs

Discrete Mathematics
Computational geometry column 18

ACM SIGACT News
Minimal tangent visibility graphs

Computational Geometry: Theory and Applications
Triangulations, visibility graph and reflex vertices of a simple polygon

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.89

Visualization

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.