NPT is a fast implementation of n-point spatial statistics. It uses kd trees in a new way that allows computations of n-point statistics at far greater speed than a naive nontree-based implementation.
NPT is funded by NSF Grant 0121671
We do not currently maintain this piece of software. If you are interested in this algorithm, you may feel free to contact the authors directly.