| Software/Program | Brief Description |
|---|---|
| STANN | A Simple Threaded Approximate Nearest Neighbor search library. |
| Minimum Enclosing Balls | We study the minimum enclosing ball (MEB) problem for sets of points or balls in high dimensions. Using techniques of second-order cone programming and ``core-sets'', we have developed (1+eps)-approximation algorithms that perform well in practice, especially for very high dimensions, in addition to having provable guarantees. |
| Finding Large Empty Ellipses. | We study a class of optimization problems in polygons that seeks to compute the largest subset of a prescribed type, e.g., a longest line segment (stick) or a maximum-area triangle or convex body (potato). This code computes the largest empty ellipse in a given polygon when the vertices of the polygon well-sample a smooth closed curve. |
| Reviver. | A surface reconstruction/normal estimation software in the making. We plan to release this software in 2007 sometime. |
| Small Programs/Scripts. | Small useful scripts/programs that I have written and used in the past. |