Sorting and Searching Algorithms
This is a paper that describes and gives comparisons for standard algorithms for sorting and searching, e.g. quick sort and red-black trees.
A very good collection of algorithms together with sample source code. Available are algorithms on linear algebra, interpolation and extrapolation, integration and evaluation of functions, random numbers, sorting, root finding, huffman coding, etc.
Binary search tree applet
This applet shows how various binary search trees work.
An Introduction to Hash Tables with Chaining
Mar, 2004 - GaulerTheGoat
This article gives a good introduction to how hash tables work, and how to choose the hash functions.
Balanced binary search tree with a doubly linked list in C++
July, 2004 - Arjan van den Boogaard
This article shows an interesting combination of a Red-Black tree and a double linked list.
Dec, 2004 - Sjaak Priester
This article shows a very simple yet effective way of doing delauney triangulation of a set of points.
Adaptively Sampled Distance Fields: A General Representation of Shape for Computer Graphics
Dec, 2000 - Sarah F. Frisken, Ronald N. Perry, Alyn P. Rockwood, Thouis R. Jones
This article explains the ADF datastructure, which seems particularly efficient at representing static shapes for rendering and collision detection, as well as requiring little memory.
Welzl's Minimum Sphere Algorithm Demystified
Mar, 2008 - Eli Kara
Easy to understand explanation of Welzl's efficient algorithm for finding the minimal bounding sphere from a set of points.
Procedural Content Generation
A wiki about procedural content generation.
Triangulation by Ear Clipping
Mar, 2008 - David Eberly
This paper describes the ear-clipping polygon triangulation algorithm in detail, and also shows how to keep it efficient by reducing the amount of verification needed on each iteration.
This site holds lots of interestering documents describing algorithms, mostly on geometrical computation, but also other more generic applications. The site is also home to the programming library Wild Magic, which is available under the Boost license.
A thousand ways to pack the bin
Feb, 2010 - Jukka Jylänki
This article presents and compares several different algorithms for packing rectangles into a bin. This is commonly used for texture atlases as a way of optimizations.