pith. sign in

arxiv: 1209.2308 · v3 · pith:LEKS2WPVnew · submitted 2012-09-11 · 💻 cs.CG · cs.DM· math.CO

Some Results On Point Visibility Graphs

classification 💻 cs.CG cs.DMmath.CO
keywords graphspointvisibilitypropertiesrecognitionsomealgorithmalong
0
0 comments X
read the original abstract

In this paper, we present three necessary conditions for recognizing point visibility graphs. We show that this recognition problem lies in PSPACE. We state new properties of point visibility graphs along with some known properties that are important in understanding point visibility graphs. For planar point visibility graphs, we present a complete characterization which leads to a linear time recognition and reconstruction algorithm.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.