software | projects | photos | archive | about | contact | subscribe  RSS

Home >> Projects (Programming) >> Useful Algorithms

A star search (A* search)

Douglas Peucker line approximation algorithm

Dijkstra's algorithm

2D and 3D Delaunay triangulation (Watson-Bowyer incremental insertion). Search for Jonathan Richard Shewchuk for well written lecture notes for implementation and Devillers algorithm for vertex removal/deletion.

Weiler-Atherton - a polygon-polygon clipping algorithm. Better than Sutherland-Hodgman which can result in degenerate polygons.

Taboo search

Genetic algorithms

Kuhn Tucker

Luhn algorithm - Checks the validity of a number. Credit cards use this algorithm such that only 10% of all numbers are Luhn numbers.

Monte Carlo method

Schulze method - commonly used to decide the winner in a vote.

Useful algorithms

On this page are some useful algorithms and heuristics that I came across at university and/or use in my work. This page is under construction. How to apply these algorithms and heuristics along with source code to follow.

US UK

US UK