COMPLEXITY ASPECTS OF VISIBILITY GRAPHS

DOI10.1142/S0218195995000179zbMath0834.68116DBLPjournals/ijcga/LinS95OpenAlexW2137756653WikidataQ56235007 ScholiaQ56235007MaRDI QIDQ4848834

Yaw-Ling Lin, Steven S. Skiena

Publication date: 20 September 1995

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195995000179

zbMATH Keywords

optimization problemsvisibility graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (7)

Characterizing and recognizing the visibility graph of a funnel-shaped polygon ⋮ On colourability of polygon visibility graphs ⋮ On-line convex planarity testing ⋮ Computing the maximum clique in the visibility graph of a simple polygon ⋮ Visibility graphs of towers ⋮ On Colourability of Polygon Visibility Graphs ⋮ Incremental convex planarity testing

This page was built for publication: COMPLEXITY ASPECTS OF VISIBILITY GRAPHS