Computing the obstacle number of a plane graph

Details Computing the obstacle number of a plane graph Computing the obstacle number of a plane graph

2011-07-22

arxiv.org/abs/1107.4624v2

Computer Science

Computational Geometry

7 pages, 3 figures

Scientific paper

An obstacle representation of a plane graph G is V(G) together with a set of opaque polygonal obstacles such that G is the visibility graph on V(G) determined by the obstacles. We investigate the problem of computing an obstacle representation of a plane graph (ORPG) with a minimum number of obstacles. We call this minimum size the obstacle number of G. First, we show that ORPG is NP-hard by reduction from planar vertex cover, resolving a question posed by [8]. Second, we give a reduction from ORPG to maximum degree 3 planar vertex cover. Since this reduction preserves solution values, it follows that ORPG is fixed parameter tractable (FPT) and admits a polynomial-time approximation scheme (PTAS).

Affiliated with

Also associated with

No associations

Rating

Computing the obstacle number of a plane graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing the obstacle number of a plane graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing the obstacle number of a plane graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-667174