On the minimum size of visibility graphs

DOI10.1016/S0020-0190(01)00227-7zbMath1013.68136OpenAlexW2124485037MaRDI QIDQ1603508

Ferran Hurtado, Alfredo García Olaverri, F. Javier Tejel, Marc Noy

Publication date: 14 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00227-7

zbMATH Keywords

combinatorial problemslower boundcomputational geometryvisibility graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• A tight lower bound on the size of visibility graphs
• A note on visibility graphs
• Triangulations, visibility graph and reflex vertices of a simple polygon
• Planar segment visibility graphs
• Minimal tangent visibility graphs
• COMPUTATIONAL GEOMETRY COLUMN 18