Hardness of Segment Cover, Contiguous SAT and Visibility with Uncertain Obstacles

TL;DR

This paper proves that the problems of segment cover, contiguous SAT, and visibility with uncertain obstacles are NP-hard, highlighting their computational complexity and implications for related geometric and logical problems.

Contribution

The paper introduces the NP-hardness of segment cover and contiguous SAT, linking geometric visibility problems with logical satisfiability under new restrictions.

Findings

Segment cover is NP-hard.

Contiguous SAT is NP-hard.

Hardness of approximation is discussed.

Abstract

We define the problem segment cover as follows. We are given a set of pairs of sub-intervals of the unit interval. The problem asks if there is a choice of a single interval from each pair such that the union of the chosen intervals covers the entire unit interval. This problem arises naturally while attempting to compute visibility between a point and a line segment in the plane in the presence of uncertain obstacles. Segment cover is equivalent to a restricted version of SAT which we call contiguous SAT. Consider a SAT with the following restrictions. An input formula is in CNF form and an ordering of the clauses is given in which clauses containing any fixed literal appear contiguously. We call this restricted problem contiguous SAT. Our main result is that the problems segment cover and contiguous SAT are NP-hard. We also discuss hardness of approximation for these problems.