I have collected most of my projects into a single distribution. Most of my projects depend on the Algorithms and Data Structures package and the Computational Geometry package anyway. The code in this distribution is up to date. STLib contains the following packages.
Closest point and distance transform to polygons in 2-D and triangle meshes in 3-D.
I have implementations of Sethian's Fast Marching Method and the Marching with a Correctness Criterion algorithm in 2-D and 3-D.
Orthogonal range queries in 3-D. I've implemented many standard data structures like octrees, kd-trees, cell arrays and projection methods.
This library has primitives like line segments and bounding boxes and containers like indexed triangle face sets.
This library has algorithms and data structures that I use in my projects. It has array classes, a half-edge data structure, a timer and more.
This package implements the point-to-point communication in the Eulerian/Lagrangian coupling of a solid and fluid solver with the ghost fluid method.
This package implements the point-to-point communication for problems that have short-range interactions with distributed data.
This package uses an ordered, upwind finite difference method to perform constant value advection.
I have done some work on solving the single-source shortest-paths problem in directed graphs with non-negative edge weights. I have implementations of Dijkstra's algorithm and the Marching with a Correctness Criterion algorithm. Follow the link to get the code.