dregs

Well, I was playing around with Processing the other day, and the inner muse inspired me to create a charming winter wonderland in the spirit of the season. I started out with an approach that used a tree data structure to accommodate the growth, but I had a mess of a time detecting collisions effectively.

Ultimately, a discrete (grid based) representation seems the best bet for now. In fact, as soon as I’d printed out some handy hexagon-tiled paper, the algorithm came to me in a flash. I’ll go over it below, and discuss the implementation in a later post.

(more…)