On the minimum size of visibility graphs

DOI10.1016/S0020-0190(01)00227-7MaRDI QIDQ1603508zbMATH OpenOpenAlexFDO

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

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 problemscomputational geometrylower boundvisibility graph

Mathematics Subject Classification ID

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

Recommendations

• Minimal visibility graphs
• On the connectivity of visibility graphs
• scientific article; zbMATH DE number 841640
• Minimal tangent visibility graphs

Cites work

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

Cited in

(5)

• A tight lower bound on the size of visibility graphs
• Minimal tangent visibility graphs
• Minimal visibility graphs
• scientific article; zbMATH DE number 841640 (Why is no real title available?)
• On the connectivity of visibility graphs

This page was built for publication: On the minimum size of visibility graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603508)