English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 15193666      Online Users : 100
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    National Tsing Hua University Institutional Repository > 歷任校長 > 李家同 (1993-1994) > 會議論文 >  Voronoi Diagrams of Moving Points in the Plane

    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80755

    Title: Voronoi Diagrams of Moving Points in the Plane
    Authors: Fu, J. J.;Lee, R. C. T.
    教師: 李家同
    Date: 1990
    Publisher: Springer Verlag
    Relation: Proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science, Pages 238-254
    Keywords: ALGORITHM
    Abstract: 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.
    Relation Link: http://www.springerlink.com/?MUD=MP
    URI: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80755
    Appears in Collections:[李家同 (1993-1994)] 會議論文
    [資訊工程學系] 會議論文

    Files in This Item:

    File SizeFormat


    SFX Query


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