Type of Document	Thesis
Author	Connor, Michael
Author's Email Address	miconnor@cs.fsu.edu
URN	etd-11082007-134658
Title	A Simple, Thread-safe, Approximate Nearest Neighbor Search
Degree	Master of Science
Department	Computer Science, Department of
Advisory Committee	Advisor Name Title Piyush Kumar Committee Chair David Whalley Committee Member Xiuwen Liu Committee Member
Keywords	Computational Geometry Approximate Nearest Neighbor Nearest Neighbor
Date of Defense	2007-09-07
Availability	unrestricted
Abstract This thesis describes the implementation of a fast, dynamic, approximate, nearest-neighbor search algorithm that works well in fixed dimensions (d < 6), based on sorting points in Morton(or z-) ordering. This algorithm scales well on multi-core/CPU shared memory systems, and can run on multiple processors simultaneously. The implementation is competitive with the best approximate nearest neighbor searching codes available on the web, especially for creating approximate k-nearest neighbor graphs of a point cloud. An extensive C++ library has been built implementing the research presented here. It can be found at: http://www.compgeom.com/~stann
Files	Filename       Size       Approximate Download Time (Hours:Minutes:Seconds)     28.8 Modem   56K Modem   ISDN (64 Kb)   ISDN (128 Kb)   Higher-speed Access    ConnorMFall2007.pdf 301.38 Kb 00:01:23 00:00:43 00:00:37 00:00:18 00:00:01