MCPcopy Create free account
hub / github.com/dhale/ipf / dt

Method dt

src/ipf/ClosestPointTransform.java:217–241  ·  view source on GitHub ↗

Algorithm DT(f) of Felzenszwalb and Huttenlocher (2004), augmented to compute the index i of the nearest sample. @param s the distance between two adjacent samples. @param f input array of accumulated distances squared. @param d output array of distances squared to nearest samples. @param i output a

(float s, float[] f, float[] d, short[] i)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 2

applyMethod · 0.95
computeMethod · 0.95

Calls

no outgoing calls

Tested by

no test coverage detected