On a circle-cover minimization problem |
| |
Authors: | CC Lee DT Lee |
| |
Affiliation: | Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL 60201, USA |
| |
Abstract: | Given a set of n circular-arcs A1, A2,...,An, we consider the problem of finding a minimum number of circular-arcs whose union covers the circle. Specifically, if the endpoints of these n arcs are given, we show that O(n log n) is both sufficient and necessary for solving the minimum cover problem. Furthermore, with O(n log n) preprocessing time we find the minimum cover in O(n) time. |
| |
Keywords: | Analysis of algorithms computational geometry minimum cover |
本文献已被 ScienceDirect 等数据库收录! |
|