Emile Contal - Homepage

doc: enet_greedy

Compute an $\epsilon$ -net of Xt given the distance matrix

Syntax

 [N, eNet] = enet_greedy(D2, e, eNetInit)

Arguments

D2 matrix (n, n) of canonical squared distance
e scalar for $\epsilon$
eNetInit vector (1, N) of indices of points in the initial $\epsilon$ -net

Outputs

N scalar for the size of the final $\epsilon$ -net
eNet vector (1, N) of indices of points in the final $\epsilon$ -net

See also

gp_dist | chaining_tree

web analytics