Nov
4
2009

This little snippet of code was given to my by my buddy Scott Parrish, who’s a fellow creature TD at ILM.

global proc float[] matrixExtractRot (matrix $aMatrix)
{
float $result[3];
$result[0] = rad_to_deg(atan2($aMatrix[1][2], $aMatrix[2][2]));
$result[1] = rad_to_deg(-asin ($aMatrix[0][2]));
$result[2] = rad_to_deg(atan2($aMatrix[0][1], $aMatrix[0][0]));
return $result;
}

Aug
18
2009

when i was i first thinking about writing the the rayIntersect function, my plan was to iterate through the entire mesh, and test all the triangles in mesh object with the rayIntersectTriangle function.

the fundamental problem with this is that to run this test on every traingle in a mesh can become very slow.

so i started thinking of running a simpler less expensive test on the faces, figure out which faces are more likely to intersect and only process those. for this i’m thinking i can figure out what the closest point along the ray is to the center of the face, and test the distance between the closet point and the center of the face.

if the this distance is larger than the diameter of the face then this triangle will be ignored.

fn closestPointOnRay ray pos =
(
w = pos - ray.pos
vsq = dot(ray.dir,ray.dir)
proj = dot(w,ray.dir)
return (ray.pos + (proj/vsq)*ray.dir)
)

i have not tested this function yet. but it should look something like this.

the next thing I’m going to do is test for the for the distance, but use a cool trick that i found in the book “Essential Mathematics for games and interactive applications”.

the most common way for solving the distance between two points is using the good all Pythagorean theory or (x2 + y2 + z2 = d2).

so in order to find the distance of a point from origin we have get the square root of (x2+y2+z2).

being that the square root is one of the heavier math calculations we can avoid it buy just test for the distance squared.

fn sqrDistance pA pB =
(
p = pA - pB
d = (p.x * p.x)+(p.xy* p.y)+(p.z * p.z)
return d
)

so we can the test would look something like

fn faceSimpleTest =
(
cp = closestPointOnRay ray.pos faceCenter
sqD = sqrDistance cp faceCenter
if sqD < faceDiameter then
(
return true
)
)

Aug
18
2009

I’m currently working in a 3d package that dosn’t have a rayintersect function available to it’s scripting lenguage. for those who don’t know a ray intersect function is used to test where and if an infinite line in space intersects a triangle. this can be used for many effects in 3d like deforming an object by projecting it’s verts into another surface, or for stoping one object from going through an other ðŸ™‚

anyway so i need to write a function in python that will allow me to do this test. i think i have found the math behind it so i figure i write it down here in MAXscript forma, so i can use this a reference to write the python version at work tommorrow

fn RayIntersectTriangle vA vB vC ray =
(
//vA vB vC are the positions of the 3 verts that make of the face were testing
e1 = vB - vA
e2 = vC - vA
p = cross(ray.dir e2)
a = dot(e1,p)
if a == 0 then return false //no intrsection here the face is parallel to the ray
//compute denominator
f = 1.0/a
//compute barycentric coords
s = ray.pos - vA
u = f * dot(s,p)
if u < 0.0 or u > 1.0 then return false //the u is outside the face
q = cross(s,e1)
v = f*dot(ray.dir,q)
if v < 0.0 or v > 1.0 then return false //the v is outside the face
t = f*dot(e2,q)
return (t >= 0)
)

so the idea is to tweak the function so it return the uv coordinates of the the intersection, which will be easy. then we’ll need to convert does barycentric coordinates to a world space position. which i will look into tomorrow.

this function can then be used to test a ray against all the faces in a geometric mesh.

this might return many intersections of which we would choose the closest one ðŸ™‚

this code was translated from the book essential mathematics for games & interactive applications.

i have not tested the code yet so there might be some bugs.