Graphics/Surfaces & Meshes

.NET	7
Artificial Intelligence	7
Group behavior	2
Path finding	16
A* and its derivatives	6
Pattern recognition	1
Steering behavior	2
World interaction	4
Audio	0
DirectX	8
DSP	5
Ogg Vorbis	2
OpenAL	1
Windows	1
Computer Science	2
Algorithms & data structures	12
BSP trees	8
Encryption	12
Randomness & noise	11
Data storage	4
File formats	14
Image	10
Resource files	2
Game Development	20
Cheat & crack prevention	10
Input	3
Timing	4
Graphics	27
Character animation	6
DirectX	24
Optimizing	8
Illumination	5
Deferred lighting	7
Global illumination	8
Lighting models	6
Screen Space Ambient Occlusion	4
Shadow maps	18
Shadow volumes	15
Image processing & synthesizing	19
Non-polygonal rendering	3
Ray tracing	3
OpenGL	12
Particle systems	7
Shaders	32
Simulation	4
Cloth	2
Clouds & sky light	7
Fire & smoke	4
Liquids	12
Surfaces & Meshes	8
Implicit surfaces	6
Parametric curves & surfaces	7
Polygon reduction & LOD	3
Subdivision surfaces	7
Terrain	7
Continuous LOD	12
Generating data	4
Voxel engines	2
Text	6
Transparency	1
Visibility determination	16
Languages	5
Assembler	20
C & C++	26
C++ exceptions	5
Calling conventions	12
Debugging	5
Memory management	7
Optimizations	6
C#	4
Creating your own language	13
Garbage collection	7
D	2
Java	4
Scripting	3
JScript & VBScript	1
Lua	6
Other languages	8
Perl	2
Python	5
Ruby	4
Mathematics	3
Fourier transform	4
Geometry	6
Linear algebra, vectors & matrices	9
Wavelet transform	5
Object design	3
Physics	5
Body dynamics	8
Collision detection	10
Polytopes	6
Platform	2
Linux	1
Mac	2
Windows	13
COM, ATL & WTL	8
Dynamically loaded libraries	6
Hooks	5
Input	2
Networking	6
Screensavers	3
Services	1
Shell	2
Small executables	3
Windows	8
Web Technologies	8

Triangulating and Extruding Arbitrary Polygons
May 2001 - Michael Fötsch
This article explains how to use the GLU library to perform tesselation of irregular polygons for rendering in DirectX. It also shows how to use GDI to retrieve the polygons of TrueType fonts.

Hugues Hoppe's homepage

Triangulate
Jan, 1989 - Paul Bourke
This article shows how to do triangulation of discrete point data, using Delauney triangulation.

Vertex Displacement Mapping using GLSL
Mar, 2006

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.

Linear-Speed Vertex Cache Optimisation
Sep, 2006 - Tom Forsyth
The article explains a fast and efficient algorithm for optimizing 3D meshes for unknown vertex cache sizes in order to boost rendering performance.

Inigo Quilez - fractals, computer graphics, mathematics, demoscene and more
Inigo Quilez
Interesting articles on various areas, as mentioned in the title. Especially valuable for those who are interested in procedurally generated content.

Dual Contouring Tutorial
Boris
Shows an article on how to build a mesh with sharp edges from discrete samples of data in a grid. Similar in theory to marching cubes algorithm, but attempts to solve some problems that the marching cubes algorithm has.