請用此 Handle URI 來引用此文件: http://hdl.handle.net/11455/38415
DC 欄位語言
dc.contributor.authorC.C.Leeen_US
dc.contributor.authorD.T.Leeen_US
dc.date1984-02en_US
dc.date.accessioned2014-06-06T08:00:47Z-
dc.date.available2014-06-06T08:00:47Z-
dc.identifier.urihttp://hdl.handle.net/11455/38415-
dc.description.abstractGiven 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.en_US
dc.language.isoen_USen_US
dc.relationInfo. Processing Letters, Volume�18, Issue�2, Page(s) �109-115.en_US
dc.subjectAnalysis of algorithmsen_US
dc.subjectcomputational geometryen_US
dc.subjectminimum coveren_US
dc.titleOn a Circle-Cover Minimization Problemen_US
dc.typeJournal Articlezh_TW
顯示於類別:資訊科學與工程學系所
文件中的檔案:
沒有與此文件相關的檔案。


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