Gets an iterator for all nodes in the mesh that are nearest to a plane. The equation for the specified plane is a x+b y+c z+d = 0. Nodes nearest the plane are those with Voronoi polyhedra that intersect the plane. In other words, a node is nearest the plane if there exists some point in the plan
(
final double a, final double b, final double c, final double d)
source not stored for this graph (policy: none)
nothing calls this directly
no test coverage detected