Corrigendum to “Note on covering monotone orthogonal polygons” [Inf. Process. Lett. 104(6) (2007) 220–227]

• A minimum r-star coverage of monotone orthogonal polygons.
• An optimal linear-time and space-sensitive algorithm.
• This is a corrected version of our earlier algorithm (IPL 104(6) 220–227).

Recently, a gap in Step 4 of Algorithm Sweep3 (and thus in Step 4 of Algorithm Minimum-Guard-Cover) presented in our paper entitled “Note on covering monotone orthogonal polygons with star-shaped polygons”, which appeared in Information Processing Letters 104(6), pp. 220–227 (2007), was pointed out by Leonidas Palios. In this corrigendum, we fix this gap and update the correctness proof in accordance with the new version of the algorithm.