Hello dreamcoders!

This is my first post here, hope this is the right section.

I'm stuck in between some 3d points. Probably the reason is that my math knowledge has worsened over years and thus cannot see the solution or it's just plain stupidity:) Although I have revised topics in geometry and math in general that could help solving the problem - no clean solution has been found yet.
Note: this is a sketch for a probable app, so I'm using stripped down java in processing.org environment. Anyways - the question is a bout algorithm, not specific language.

The app reads in OBJ file.
In return I get:
• mutable ArrayList
• ArrayList contains n PVector[] arrays
Each PVector[] array contains point coordinates for a face in obj model. Basically PVector[] is the same as some Vector[] which type would be something like


For clarity let us assume that OBJ model contains only one face: ArrayList then would have size==1 and the only PVector[] showing all vertexes of a poly would look like


Visually


Forget the cube in the pic it's only to show that the polygon can be rotated against any axis.
Polygon can be concave and convex. It cannot have holes.

What I'm trying to achieve:

Construct coordinates for points:
• that belongs to the 3D polygon plane
• AND is inside polygon "borders"
• AND that are regularly distributed as a grid where step is some variable S

A polygon filled with such a grid (perspective view)


The visual representation for the app is one of the goal, but each point of the grid has to be known. I mean - I need those point coord. for further calculus, it's not that the solution can be only visual - i.e. texture mapping on that poly.

As for now everything works in "2D" - if the poly is parallel to any of the planes that can be constructed from 2 axes (x-y, y-z, x-z) - plane normal is || to cross(x,y) or cross(x,z) or cross(y,x). In this case I construct a bounding rectangle for the poly, then using step S walk through inside the rect and check if the point is inside poly using Jordan Curve Theorem.
As I start working with a poly which surface normal isn't parallel/perpendicular to any axis.... I'm drowning into loops loops loops...
From the only info - vertex coords - about some poly ABC I can directly get:
• vectors belonging and parallel to poly plane - AB & BC & ..
• surface normal - cross product of any two vectors (that are not parallel) belonging to the poly
• plane equation
• a 3d bounding box (which doesn't help )
I can test for example if a point p lies on plane by
n(p-p0)=0 , where n- plane normal (known-calculated); p0 - some position vector (point) on a plane (known-one of vertexes).

Resumē:
Does anybody has an idea for an algorithm, that could create 3D points that are distributed in a grid with some step S inside a 3D poly & belonging to poly plane.
The only thing known about poly is it's
- vertex coordinates
- and the order of vertexes (the PVector[] array contains sequential vertex coordinates, "walking along the perimeter").

Many many thanks in advance,
Kroko