K3Match: Point matching in 3D space

Discussion topics for individual codes
Post Reply
User avatar
owlice
Guardian of the Codes
Posts: 1109
Joined: Wed Aug 04, 2004 4:18 pm
Location: Washington, DC

K3Match: Point matching in 3D space

Post by owlice » Wed Jul 10, 2013 2:42 am

[c]K3Match: Point matching in 3D space[/c][/b]
Abstract: K3Match is a C library with Python bindings for fast matching of points in 3D space. It uses an implementation of three dimensional binary trees to efficiently find matches between points in 3D space. Two lists of points are compared and match indices as well as distances are given. K3Match can find either the nearest neighbour or all matches within a given search distance in 3D Cartesian space or on the surface of the 2D unit sphere in standard spherical or celestial coordinates.

Credit: Schellart, Pim

Site: https://github.com/pschella/k3match
https://ui.adsabs.harvard.edu/abs/2012A%26A...544A..18V

Bibcode: 2013ascl.soft07003S

ID: ascl:1307.003
Last edited by Ada Coda on Thu Aug 22, 2019 1:26 pm, edited 1 time in total.
Reason: Updated code entry.
Code-seeking owl at your service

User avatar
owlice
Guardian of the Codes
Posts: 1109
Joined: Wed Aug 04, 2004 4:18 pm
Location: Washington, DC

Re: K3Match: Point matching in 3D space

Post by owlice » Thu Aug 22, 2019 1:26 pm

Modified abstract; original was "K3Match is a C library with Python bindings for fast matching of points in 3D space. It uses 3-dimensional binary trees to find matches between large datasets in O(N log N) time."
Added github link to site; updated ADS link to new ADS format.
Code-seeking owl at your service

Post Reply