請用此 Handle URI 來引用此文件: http://hdl.handle.net/11455/38404
標題: On Finding the Diameter of a Set of Lines
作者: Y.T.Ching
D.T.Lee
關鍵字: Model of computation
Analysis of algorithms
Computational geometry
Diameter
Lower bound
出版社: Elsevier B.V.
摘要: Consider a set of�n�straight lines in the plane. The diameter of the set of lines is the distance between the farthest pair of intersection points determined by the set of lines. In this paper we present an�O(n�log�n) algorithm for computing the diameter and show that the algorithm is optimal to within a constant factor under the algebraic computation tree model of Ben-Or.
URI: http://hdl.handle.net/11455/38404
顯示於類別:資訊科學與工程學系所

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


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