Dominating set of rectangles intersecting a straight line

Document Type

Conference Article

Publication Title

CCCG 2017 - 29th Canadian Conference on Computational Geometry, Proceedings

Abstract

We study the dominating set problem using axis-parallel rectangles and unit squares on the plane. These geometric objects are constrained to be intersected by a straight line which makes an angle with the x-axis. For axis-parallel rectangles, we prove that this problem is NP-complete. When the objects are axis-parallel unit square, we give a polynomial time algorithm. For unit squares which touch the straight line at a single point from either side of the straight line, we give an O(n log n) time algorithm.

First Page

144

Last Page

149

Publication Date

1-1-2017

This document is currently not available here.

Share

COinS