The time complexity of this algorithm is equal to O ( nlogn+ n [ d/ 2]), if an auxiliary data structure called Delaunay Tree is used in it.

  • 如果采用一种称为Delaunay树的数据结构来辅助点的定位,则算法的效率为O(nlogn+n[d/2])。

  • 互联网摘选 2025-01-19 23:22:19

    • 相关例句
    精确
    • 模糊
    • 词首
    • 词尾
    • 词义
    • 例句