Dear All,

Perhaps a math question but I think someone in this forum knows.

I have a 3D plane defined by 3 floating points. I determine the plane equation parameters (a*x+b*y+c*z+d=0). I want to test all integer points (x,y,z) of the domain if them are in the plane. I have to verify the equation a*x+b*y+c*z+d=0. But because (x,y,z) are discrete the equation could not be fulfill by any point. How can I find “delta” in order that ‘|a*x+b*y+c*z+d| < delta’ in order to find a plane with only one layer (one point thick) of points.

Thanks,

Luís Gonçalves