You are here

Simple, Thread-Safe, Approximate Nearest Neighbor Algorithm

Title: A Simple, Thread-Safe, Approximate Nearest Neighbor Algorithm.
Name(s): Connor, Michael F., author
Kumar, Piyush, professor directing thesis
Whalley, David, committee member
Liu, Xiuwen, committee member
Department of Computer Science, degree granting department
Florida State University, degree granting institution
Type of Resource: text
Genre: Text
Issuance: monographic
Date Issued: 2007
Publisher: Florida State University
Place of Publication: Tallahassee, Florida
Physical Form: computer
online resource
Extent: 1 online resource
Language(s): English
Abstract/Description: This thesis describes the implementation of a fast, dynamic, approximate, nearest-neighbor search algorithm that works well in fixed dimensions (d 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:
Identifier: FSU_migr_etd-3453 (IID)
Submitted Note: A Thesis submitted to the Department of Computer Science in partial fulfillment of the requirements for the degree of Master of Science.
Degree Awarded: Fall Semester, 2007.
Date of Defense: November 7, 2007.
Keywords: Computational Geometry, Approximate Nearest Neighbor, Nearest Neighbor
Bibliography Note: Includes bibliographical references.
Advisory Committee: Piyush Kumar, Professor Directing Thesis; David Whalley, Committee Member; Xiuwen Liu, Committee Member.
Subject(s): Computer science
Persistent Link to This Record:
Owner Institution: FSU

Choose the citation style.
Connor, M. F. (2007). A Simple, Thread-Safe, Approximate Nearest Neighbor Algorithm. Retrieved from