Before revision:  We present an algorithm of O( (n + m) log(n + m )) time for any m . These problems may have applications in mobile sensor barrier coverage in wireless sensor networks.
After revision:  We present an algorithm of O( (n + m) log(n + m )) time for any m \geq 1. These problems may have applications in mobile sensor barrier coverage in wireless sensor networks.