Spherical Indexing for Neighborhood Queries

Details Spherical Indexing for Neighborhood Queries Spherical Indexing for Neighborhood Queries

2006-08-29

arxiv.org/abs/cs/0608108v1

Computer Science

Data Structures and Algorithms

9 pages, 10 figures. The source code is available at http://nicolas.brodu.free.fr/en/programmation/neighand/index.html

Scientific paper

This is an algorithm for finding neighbors when the objects can freely move and have no predefined position. The query consists in finding neighbors for a center location and a given radius. Space is discretized in cubic cells. This algorithm introduces a direct spherical indexing that gives the list of all cells making up the query sphere, for any radius and any center location. It can additionally take in account both cyclic and non-cyclic regions of interest. Finding only the K nearest neighbors naturally benefits from the spherical indexing by minimally running through the sphere from center to edge, and reducing the maximum distance when K neighbors have been found.

Affiliated with

Also associated with

No associations

Rating

Spherical Indexing for Neighborhood Queries does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Spherical Indexing for Neighborhood Queries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Spherical Indexing for Neighborhood Queries will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-333368