Constant time algorithms for the 3-D all nearest neighbor problem on the LARPBS

被引：0

作者：

Wang, YR ^{[1
]}

Horng, SJ

机构：

[1] St Johns & St Marys Inst Technol, Dept Comp Sci & Informat Engn, Taipei, Taiwan

[2] Natl Taiwan Univ Sci & Technol, Dept Comp Sci & Informat Engn, Taipei, Taiwan

来源：

PARALLEL AND DISTRIBUTED COMPUTING: APPLICATIONS AND TECHNOLOGIES, PROCEEDINGS | 2004年 / 3320卷

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Two O(1) time algorithms for solving the 3-D all nearest neighbor (3D_ANN) problem of n points using an LARPBS of size (1)/(2) n(7)/(4) (divided byepsilon) and respectively are proposed. To the best of our knowledge, all results derived above are the best O(1) time 3D_ANN algorithms known.

引用

页码：243 / 247

页数：5

共 50 条

[1] Performance analysis of nearest neighbor algorithms for ICP registration of 3-D point sets
Zinsser, T
Schmidt, J
Niemann, H
VISION, MODELING, AND VISUALIZATION 2003, 2003, : 199 - 206
[2] ALL NEAREST-NEIGHBOR PROBLEM FOR CONVEX POLYGONS
LEE, DT
PREPARATA, FP
INFORMATION PROCESSING LETTERS, 1978, 7 (04) : 189 - 192
[3] Almost constant-time 3D nearest-neighbor lookup using implicit octrees
Drost, Bertram H.
Ilic, Slobodan
MACHINE VISION AND APPLICATIONS, 2018, 29 (02) : 299 - 311
[4] Almost constant-time 3D nearest-neighbor lookup using implicit octrees
Bertram H. Drost
Slobodan Ilic
Machine Vision and Applications, 2018, 29 : 299 - 311
[5] EFFECTIVE ALGORITHMS FOR THE NEAREST-NEIGHBOR METHOD IN THE CLUSTERING PROBLEM
HATTORI, K
TORII, Y
PATTERN RECOGNITION, 1993, 26 (05) : 741 - 746
[6] Weighted nearest neighbor algorithms for the graph exploration problem on cycles
Asahiro, Yuichi
Miyano, Eiji
Miyazaki, Shuichi
Yoshimuta, Takuro
INFORMATION PROCESSING LETTERS, 2010, 110 (03) : 93 - 98
[7] Weighted nearest neighbor algorithms for the graph exploration problem on cycles
Asahiro, Yuichi
Miyano, Eiji
Miyazaki, Shuichi
Yoshimuta, Takuro
SOFSEM 2007: THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2007, 4362 : 164 - +
[8] NOTE ON THE ALL NEAREST-NEIGHBOR PROBLEM FOR CONVEX POLYGONS
YANG, CC
LEE, DT
INFORMATION PROCESSING LETTERS, 1979, 8 (04) : 193 - 194
[9] ALL NEAREST-NEIGHBOR PROBLEM FOR CONVEX POLYGONS - COMMENTS
FOURNIER, A
KEDEM, Z
INFORMATION PROCESSING LETTERS, 1979, 9 (03) : 105 - 107
[10] Prototype, nearest neighbor and hybrid algorithms for time series classification
Wisotzki, C
Wysotzki, F
MACHINE LEARNING: ECML-95, 1995, 912 : 364 - 367

← 1 2 3 4 5 →