MCPcopy Create free account
hub / github.com/dhale/jtk / getNodesNearestPlane

Method getNodesNearestPlane

core/src/main/java/edu/mines/jtk/mesh/TetMesh.java:2518–2641  ·  view source on GitHub ↗

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 from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers

nothing calls this directly

Calls 12

findNodeNearestPlaneMethod · 0.95
getTetNaborsMethod · 0.95
clearNodeMarksMethod · 0.95
clearTetMarksMethod · 0.95
markMethod · 0.95
isMarkedMethod · 0.95
centerSphereMethod · 0.95
iteratorMethod · 0.80
addMethod · 0.65
sizeMethod · 0.65
isEmptyMethod · 0.45
removeMethod · 0.45

Tested by

no test coverage detected