Computing the obstacle number of a plane graph

Computer Science – Computational Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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).

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-667174

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.