for those who don’t know, a convex hull is the tightest volume enclosing a given set of vertices so that none of them lies outside the volume. it can be useful in some cases, like when you want to perform coarse collision detection on a complex volume.
Read the rest of this entry »

my first Flash on The Beach is over, it was one of the best times I’ve had in a long while.
spending 4 days with talented flashers/designers/creatives/devs from around the world is really a unique experience. I had a chance to attend sessions by people I consider to be the best digital artists but also to find myself new heroes.

[update]an implementation of the incremental convex hull algorithm is available here

Read the rest of this entry »

using the simulated annealing algorithm to find solutions to the traveling salesman problem
Read the rest of this entry »