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

Method findNodeNearestSlow

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

Finds the node nearest to the point with specified coordinates. This method appears to be 2-3 times slower than findNodeNearest, but it is a lot of code, so we make it private for now. (Currently unused.) @param x x-coordinate. @param y y-coordinate. @param z z-coordinate. @return the node nearest t

(float x, float y, float z)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 2

testAddFindRemoveMethod · 0.95
benchFindMethod · 0.95

Calls 10

clearTetMarksMethod · 0.95
clearNodeMarksMethod · 0.95
updateNodeNearestMethod · 0.95
locatePointMethod · 0.95
isOnNodeMethod · 0.95
nodeMethod · 0.95
isInsideMethod · 0.95
findNodeNearestInsideMethod · 0.95
tetMethod · 0.95

Tested by 2

testAddFindRemoveMethod · 0.76
benchFindMethod · 0.76