- Visibility graphs of polygons
- Project Year:
2022
- REU Student (s):
Gaurav Kucheriya | Charles University (Prague, Czech Republic)
- Student 1 Institution:
Charles University (Prague, Czech Republic)
- Project Mentor:
James Abello
- Project Mentor Area:
Computer Science
- Project Abstract:
The visibility graph recognition problem asks to determine if for a given graph G there is a polygon P having G as its visibility graph. It is not known to be in NP. Here we show that persistent graphs having a block of consecutive blocking vertices can be realized as a polygon.We conjecture that this technique can be extended to realize a larger subclass of persistent graphs.
