Chances are good that you don’t know who Richard Platt is. Richard was never in the business of self-promotion - had he been, he could have been a household name among the cognoscenti. But Richard didn’t spend his time talking to the press, speaking at conferences, or teeing up with the titans of industry. His […]

continue reading.....

Dr. Dobb’s PortalSeptember, 2007
Article on DDJ site

Finding the Convex Hull of a set of points is an interesting problem in computational geometry. It is useful as a building block for a diverse set of applications, including thing such as:

Collision detection in video games, providing […]

continue reading.....

This article discusses the use of C++ hash containers to improve storage of subproblem results when using dynamic programming (DP.) Memoization is a key part of dynamic programming, which is conventionally done by storing subproblem results in simple tables or lists. Using hash tables instead of these simpler structures will allow you to use dynamic programming while retaining your algorithm’s natural recursive structure, simplifying design and making your code easier to follow. I’ll provide a fully-developed example of an algorithm, and show how it can be adapted to use hash table memoization.

continue reading.....