Skip to content

An algorithm to find matching nanowires from a set of nanowires in a fixed spatial configuration and the same set under an unkown transformation. The algorithm uses kd-trees, nearest-neighbour searching, and geometric hash mapping.

Notifications You must be signed in to change notification settings

savergenio/nanowire-spatial-location

 
 

Repository files navigation

nanowire-spatial-location

An algorithm to find matching nanowires from a set of nanowires in a fixed spatial configuration and the same set under an unkown transformation. The algorithm uses kd-trees, nearest-neighbour searching, and geometric hash mapping.

The example dataset is given as a text file and contains information about a nanowire set.

This work is under a CC-BY-NC License and was developed at the School of Physics and Astronomy, University of Manchester.

About

An algorithm to find matching nanowires from a set of nanowires in a fixed spatial configuration and the same set under an unkown transformation. The algorithm uses kd-trees, nearest-neighbour searching, and geometric hash mapping.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • C 100.0%