請用此 Handle URI 來引用此文件: http://hdl.handle.net/11455/38432
標題: Dynamic Voronoi Diagrams
作者: I.G.Gowda
D.G.Kirkpatrick
D.T.Lee
A.Naamad
摘要: A new dynamizing technique is introduced whereby n point Voronoi diagrams (both closest and farthest point) can be updated in O(n) time per insertion or deletion, in the worst case. General properties of these dynamic Voronoi diagrams are explored including a storage/ deletion-time trade-off. In addition, their application to such problems as nearest neighbor search and the Z-minimum spanning circle problem is discussed.
URI: http://hdl.handle.net/11455/38432
顯示於類別:資訊科學與工程學系所

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


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