Hello everyone!
I have a question, for that i can’t seem to find a good answer for on Google.
The question is this:
I have a plane in 3-dimensional space, that is stored as a object containing a plane-equation,position and a surface-Normal.
And I have a set of n 3D-points, that all are lying on the plane.
// Probably important: Im using Vector's as Point's and vice-versa.
class Vector
{
float x,y,z;
-snippedTheRestOfTheClass-
}
class Plane
{
float d;
Vector position;
Vector normal;
-snippedTheRestOfTheClass-
}
Now i wan’t to generate Triangle’s from these points-on-the-plane.
Im somewhat unable to successfully implement a algorythm that does that for me.
My math-teacher told me I should try to ‘2D-project’ the point’s onto the plane and connect them then using 2D logic.
Too bad I don’t know how to do this right.
Please help!
- Longor1996
PS: Im (still) sick, so please write in a way that i don’t have problems to understand the things you write.
PPS: Also, i wan’t to generate as few triangle’s as possible, if that is possible.
PPPS: The generation of these triangle’s is for ‘offline’-use, so it doesn’t have to be fast.