---

for (i=0;i<PointListLen-2;i++,TriCount++) {

    TriList[TriCount].Vert[0] = PointList[0];

    TriList[TriCount].Vert[1] = PointList[i+1];

    TriList[TriCount].Vert[2] = PointList[i+2];

}

---

Originally posted by BigBrain

---

Originally posted by messiaen

---

Originally posted by spinout

---

---

for (i=0;i<PointListLen-2;i++,TriCount++) {

    TriList[TriCount].Vert[0] = PointList[0];

    TriList[TriCount].Vert[1] = PointList[i+1];

    TriList[TriCount].Vert[2] = PointList[i+2];

}

---

I hope this helps!

---

Seems simple, I can probably flexibilize my parsing code by using strtok() to find the number of faces in polygon. Thanks!

---

I'd advise you against using this code for other polyons than tris and quads, since it might produce strange effects when using higher order polygons than quads (if the polygon isn't concave* for example). These effects would be a pain to properly recognize and "debug", so you should probably fail (not just warn or be quiet) if someone tries to import an obj file containing faces with more than 4 edges (not sure whether you're doing that already).
But for triangles and quads this code works just fine of course, yeah.

* I think the problems even only arise if the polygon _is_ concave. For convex faces you might still try to apply the algorithm, but that'd bloat the "validity" check on the other hand, so you might be best off just disabling support for anything greater than quads.

---

Originally posted by wwwarea

---

I was using collision type 13, A, and 23. Thats all I could remember. So I type them like collisionType 23 but it diddn't work like the lava. Yeah, I used the list, when you said decimal, what did you mean like that? Like can you please tell me how I should type 0013 for very slippery hill if I wasn't typing it right?

---

hexadecimal	: decimal

0xA		: 10

0x13		: 19

0x23		: 35