I haven't dealt with 3D in agk, but can you pull a list of verts? Here's my thought. Each poly would form the base of a triangular pyramid, where the pyramid's apex is at the center of your object (and all other pyramids' apex is at the same point). Calculate the volume for each pyramid; which is the area of the polygon (triangular surface on your convex hull) time's 1/3 the height of the pyramid (distance from the surface of the poly to that inner apex point).
V = 1/3(AH)
Something like:
// mid is a 3d vector and vert is an array of 3d vectors (local points on object)
for i = 0 to vert.count
mid = mid + vert[i]
next i
mid = mid / vert.count
for i = 0 to vert.count-3 step 3
A = vert[i]
B = vert[i+1]
C = vert[i+2]
// find distance of that surface to mid (see link below)
// do volume calculation
v = 1/3(AH)
totalVolume = totalVolume + v
next i
This is just rough pseudo-code. Don't even know if my theory would work.
Distance from point to a plane
I thought he wanted 3D, not sprites?
If he's after 3D, I did just find this (after coming up with my own idea):
"I like offending people, because I think people who get offended should be offended." - Linus Torvalds
