請用此 Handle URI 來引用此文件: http://hdl.handle.net/11455/38415
標題: On a Circle-Cover Minimization Problem
作者: C.C.Lee
D.T.Lee
關鍵字: Analysis of algorithms
computational geometry
minimum cover
摘要: 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.
URI: http://hdl.handle.net/11455/38415
顯示於類別:資訊科學與工程學系所

文件中的檔案:
沒有與此文件相關的檔案。


在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。