It would be nice to have convex hull implementations for 2D/3D space. There are several known algorithms http://en.wikipedia.org/wiki/Convex_hull_algorithms:
- Graham scan: O(n log n)
- Incremental: O(n log n)
- Divide and Conquer: O(n log n)
- Kirkpatrick-Seidel: O(n log h)
- Chan: O(n log h)
The preference would be on an algorithm that is easily extensible for higher dimensions, so Incremental and Divide and Conquer would be prefered.