On Covering Points with Conics and Strips in the Plane
Geometric covering problems have always been of focus in computer scientific research. The generic geometric covering problem asks to cover a set S of n objects with another set of objects whose cardinality is minimum, in a geometric setting. Many versions of geometric cover have been studied in det...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
2013
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1969.1/148314 |