Efficient randomized incremental algorithm for the closest pair problem using Leafary trees

被引：0
|
作者：
Kamakoti, V
Krithivasan, K
Rangan, CP
机构：
来源：
COMPUTING AND COMBINATORICS | 1995年 / 959卷
关键词：
closest pair; computational geometry; randomized algorithms;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We present a new data structure, the Leafary tree, for designing an efficient randomized algorithm for the Closest Pair Problem. Using this data structure, we show that the Closest Pair of 22 points in D-dimensional space, where, D greater than or equal to 2, is a fixed constant, can be found in O(n log n/log log n) expected time. The algorithm does not employ hashing.
引用
收藏
页码：71 / 80
页数：10
相关论文
共 50 条
12345