SANN: A parameter-free nearest-neighbor algorithm

Details SANN: A parameter-free nearest-neighbor algorithm SANN: A parameter-free nearest-neighbor algorithm

2012-02-23

arxiv.org/abs/1202.5281v2

Physics

Condensed Matter

Soft Condensed Matter

Scientific paper

We propose a parameter-free algorithm for the identification of nearest neighbors. The algorithm is very easy to use and has a number of advantages over existing algorithms to identify nearest-neighbors. This solid-angle based nearest-neighbor algorithm (SANN) attributes to each possible neighbor a solid angle and determines the cutoff radius by the requirement that the sum of the solid angles is 4\pi. The algorithm can be used to analyse 3D images, both from experiments as well as theory, and as the algorithm has a low computational cost, it can also be used "on the fly" in simulations. In this paper, we describe the SANN algorithm, discuss its properties, and compare it to both a fixed-distance cutoff algorithm and to a Voronoi construction by analyzing its behavior in bulk phases of systems of carbon atoms, Lennard-Jones particles and hard spheres as well as in Lennard-Jones systems with liquid-crystal and liquid-vapor interfaces.

Affiliated with

Also associated with

No associations

Rating

SANN: A parameter-free nearest-neighbor algorithm 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 SANN: A parameter-free nearest-neighbor algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and SANN: A parameter-free nearest-neighbor algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-77431