Please use this identifier to cite or link to this item: http://hdl.handle.net/11455/38457
標題: On k-Nearest Neighbor Voronoi Diagrams in the Plane
作者: D.T.Lee
摘要: The notion of Voronoi diagram for a set of N points in the Euclidean plane is generalized to the Voronoi diagram of order k and an iterative algorithm to construct the generalized diagram in 0(k2N log N) time using 0(k2(N − k)) space is presented. It is shown that the k-nearest neighbor problem and other seemingly unrelated problems can be solved efficiently with the diagram.
URI: http://hdl.handle.net/11455/38457
ISSN: 0018-9340
Appears in Collections:資訊科學與工程學系所

文件中的檔案:

取得全文請前往華藝線上圖書館



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.