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 条
  • [21] The Anglerfish algorithm: a derivation of randomized incremental construction technique for solving the traveling salesman problem
    Pook, Mei F.
    Ramlan, Effirul I.
    EVOLUTIONARY INTELLIGENCE, 2019, 12 (01) : 11 - 20
  • [22] The Anglerfish algorithm: a derivation of randomized incremental construction technique for solving the traveling salesman problem
    Mei F. Pook
    Effirul I. Ramlan
    Evolutionary Intelligence, 2019, 12 : 11 - 20
  • [23] An Algorithm using Context Reduction for Efficient Incremental Generation of Concept Set
    Kovacs, Laszlo
    FUNDAMENTA INFORMATICAE, 2019, 165 (01) : 43 - 73
  • [24] HybridTreeMiner: An efficient algorithm for mining frequent rooted trees and free trees using canonical forms
    Chi, Y
    Yang, YR
    Muntz, RR
    16TH INTERNATIONAL CONFERENCE ON SCIENTIFIC AND STATISTICAL DATABASE MANAGEMENT, PROCEEDINGS, 2004, : 11 - 20
  • [25] Optimizing curriculum scheduling problem using population based incremental learning algorithm
    Jiang, Qun
    Ou, Yang
    Shi-Du, Dong
    SECOND WORKSHOP ON DIGITAL MEDIA AND ITS APPLICATION IN MUSEUM & HERITAGE, PROCEEDINGS, 2007, : 448 - +
  • [26] An efficient shadow algorithm for area light sources using BSP trees
    Wong, KW
    Tsang, WW
    PACIFIC GRAPHICS '98, PROCEEDINGS, 1998, : 97 - +
  • [27] EFFICIENT ALGORITHM FOR GRAPH-PARTITIONING PROBLEM USING A PROBLEM TRANSFORMATION METHOD
    LEE, CH
    PARK, CI
    KIM, M
    COMPUTER-AIDED DESIGN, 1989, 21 (10) : 611 - 618
  • [28] Enhanced parallelization of the incremental 4D-Var data assimilation algorithm using the Randomized Incremental Optimal Technique
    Bousserez, Nicolas
    Guerrette, Jonathan J.
    Henze, Daven K.
    QUARTERLY JOURNAL OF THE ROYAL METEOROLOGICAL SOCIETY, 2020, 146 (728) : 1351 - 1371
  • [29] USING THE GNG-M ALGORITHM TO DEAL WITH THE PROBLEM OF CATASTROPHIC FORGETTING IN INCREMENTAL MODELLING
    Satizabal M, Hector F.
    Perez-Uribe, Andres
    NCTA 2011: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON NEURAL COMPUTATION THEORY AND APPLICATIONS, 2011, : 267 - 276
  • [30] Unit Commitment Problem Using An Efficient PSO Based Algorithm
    Zhai, Yu
    Mu, Nankun
    Liao, Xiaofeng
    Le, Junqing
    Huang, Tingwen
    2019 ELEVENTH INTERNATIONAL CONFERENCE ON ADVANCED COMPUTATIONAL INTELLIGENCE (ICACI 2019), 2019, : 320 - 324
12345