- a Union-Find datastructure implementation, and its usage to find the threshold percolation probability in 2D
- an efficient Queue implementation that enables a quick search for collinear points in R^n
- a kd-Tree implementation, applied to efficient search of points in rectangular regions of plane