HIDIHO! » convex

incremental 3D convex hull

nicoptere — Mon, 22 Aug 2011 12:01:21 +0000

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. very soon I’ll attend the Flash On The […]

“I’m not impressed at all…”

nicoptere — Sat, 02 Oct 2010 13:35:10 +0000

concave polygon > box2D

nicoptere — Fri, 27 Feb 2009 22:16:45 +0000

now here's a little demo of what the ear cutting algorithm can do