Negative results on characterizing visibility graphs
From MaRDI portal
Publication:1900990
DOI10.1016/0925-7721(95)00021-ZzbMATH Open0831.68111MaRDI QIDQ1900990FDOQ1900990
Authors: Yanyan Li 
Publication date: 29 October 1995
Published in: Computational Geometry (Search for Journal in Brave)
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Incidence matrices and interval graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Euclidean shortest paths in the presence of rectilinear barriers
- Title not available (Why is that?)
- On a Probabilistic Graph-Theoretical Method
- On recognizing and characterizing visibility graphs of simple polygons
- Hiding people in polygons
- Recognizing visibility graphs of spiral polygons
- Title not available (Why is that?)
Cited In (11)
- A note on minimal visibility graphs
- A characterization of visibility graphs for pseudo-polygons
- Non-stretchable pseudo-visibility graphs
- Visibility graphs of 2-spiral polygons (extended abstract)
- Orthogonal polygon reconstruction from stabbing information
- Terrain visibility graphs: persistence is not enough
- ORTHOGONAL EDGE VISIBILITY GRAPHS OF POLYGONS WITH HOLES
- Visibility properties and forbidden holes in graphs
- Disproving a conjecture on planar visibility graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Negative results on characterizing visibility graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900990)
