請用此 Handle URI 來引用此文件: http://hdl.handle.net/11455/38467
標題: Generalization of Voronoi Diagram in the Plane
作者: D.T.Lee
R.L.Drysdale
關鍵字: Voronoi diagram, computational geometry, point location, computational complexity, divide-and-conquer, analysis of algorithms
摘要: In this paper we study the Voronoi diagram for a set of N line segments and circles in the Euclidean plane. The diagram is a generalization of the Voronoi diagram for a set of points in the plane and has applications in wire layout, facility location, clustering and contouring problems. We present an O(N(log N)a) algorithm for constructing the diagram. It is an improvement of a previous known result which takes O(Nc"/l) time. The algorithm described in this paper is also shown to be applicable under a more general metric if certain conditions are satisfied.
URI: http://hdl.handle.net/11455/38467
顯示於類別:資訊科學與工程學系所

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


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