Supported by NSF, FSU, NASA, AMD
-
STANN
A Simple Threaded Approximate Nearest Neighbor search library written in C++ that can also be used to compute Eucledian Minimum spanning trees.
-
MEB
An implementation of (1+ε)-approximation algorithm for computing Minimum Enclosing Balls of points in high dimensions.
-
Find Large Empty Ellipses
An implementation for finding approximate empty ellipses inside well sampled polygons.
-
Reviver
A surface reconstruction algorithm in the making.
-
ProteoExplorer
A customized software for the analysis and visualization of large-scale proteomic mass spectrum datasets.
