National Tsing Hua University Institutional Repository:Voronoi Diagrams of Moving Points in the Plane
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 54367/62174 (87%)
造访人次 : 13683906      在线人数 : 53
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻
    National Tsing Hua University Institutional Repository > 歷任校長 > 李家同 (1993-1994) > 會議論文 >  Voronoi Diagrams of Moving Points in the Plane


    题名: Voronoi Diagrams of Moving Points in the Plane
    作者: Fu, J. J.;Lee, R. C. T.
    教師: 李家同
    日期: 1990
    出版者: Springer Verlag
    關聯: Proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science, Pages 238-254
    关键词: ALGORITHM
    摘要: In this paper, we consider the dynamic Voronoi diagram problem. In this problem, a given set of planar points are moving and our objective is to find the Voronoi diagram of these moving points at any time t. A preprocessing algorithm and a query processing algorithm are presented in this paper. Assume that the points are in k-motion, and it takes O(k) time to find the roots of a polynomial with degree O(k). The preprocessing algorithm uses O(k2n3logn⋅2O(α(n)5k+1)) time to process moving functions of given points, and uses O(k2n3⋅2O(α(n)5k+1)) space to store the preprocessing result where α(n) is the functional inverse of Ackermann's function. The query processing algorithm is designed to report the Voronoi diagram of these points for a query time t. It takes O(n) time which is optimal.
    显示于类别:[李家同 (1993-1994)] 會議論文
    [資訊工程學系] 會議論文


    档案 大小格式浏览次数


    SFX Query


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈