data points inside a pyramid

Hello all, I have a triangular base pyramid having four points (three for triangular base and one for height). how can I get the inside points of the pyramid ? Thank you .

[yogesh jain]

If anybody can help me out ... please do !!

[Guillaume]

Your question is not clear. There are an infinity of points inside a pyramid.

[yogesh jain]

yes , actually those are infinite but the minimum set of points which can represent the pyramid .

[jgg]

Would that not just be the three base points, which you have, and then add the height to the centroid of those points?

[yogesh jain]

ya would be but that does not solve getting the inside data points issue . They may be limited and layered data points .

[jgg]

If you have the three base points, and the peak of the pyramid, then any other point is just a linear combination of the base points, and then the peak.

Answer 1

[Guillaume]

We're going round in circles. Your solid (which is a tetrahedron by the way, not a pyramid) is uniquely defined by 4 four points, the ones you start with. This is the "minimum set of points which can represent" it.

As with any geometric shape, there are an infinity of "inside data point". It's of course not possible to return an infinity of points.

Or are you asking for a way to check that a given point is inside the tetrahedron?

[yogesh jain]

Hello Mr.Guillaume , Thanks for your consideration . The second way would also be beneficial for me .

[yogesh jain]

For better understanding, this is the situation - blue dots are available points , red are vertices of pyramid (having yellow faces) , now how to get inside points ??