Negative results on characterizing visibility graphs

DOI10.1016/0925-7721(95)00021-ZzbMath0831.68111MaRDI QIDQ1900990

Yanyan Li

Publication date: 29 October 1995

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

visibility graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

Orthogonal polygon reconstruction from stabbing information ⋮ A Characterization of Visibility Graphs for Pseudo-polygons ⋮ Non-stretchable pseudo-visibility graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On recognizing and characterizing visibility graphs of simple polygons
• Hiding people in polygons
• Incidence matrices and interval graphs
• Euclidean shortest paths in the presence of rectilinear barriers
• Recognizing visibility graphs of spiral polygons
• On a Probabilistic Graph-Theoretical Method

This page was built for publication: Negative results on characterizing visibility graphs