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 »
incremental 3D convex hull
Android – debut
I’ve spent my last month learning Android, time to share.
Read the rest of this entry »
treemaps
this one’s about treemaps aka space constrained visualization of hierarchical data.
treemap is shorter :)
Read the rest of this entry »
B.I.G.A. 7 : TOOLS FOR LINES
this is more of a “technical” or at least practical post.
Read the rest of this entry »
FlashDevelop
HAXE
my beloved readers wrote…