Uses of Class
de.lmu.ifi.dbs.elki.algorithm.projection.BarnesHutTSNE.QuadTree

Packages that use BarnesHutTSNE.QuadTree

Package	Description
de.lmu.ifi.dbs.elki.algorithm.projection	Data projections (see also preprocessing filters for basic projections).

Uses of BarnesHutTSNE.QuadTree in de.lmu.ifi.dbs.elki.algorithm.projection

Fields in de.lmu.ifi.dbs.elki.algorithm.projection declared as BarnesHutTSNE.QuadTree

Modifier and Type	Field and Description
BarnesHutTSNE.QuadTree[]	BarnesHutTSNE.QuadTree.children Child nodes.

Methods in de.lmu.ifi.dbs.elki.algorithm.projection that return BarnesHutTSNE.QuadTree

Modifier and Type	Method and Description
static BarnesHutTSNE.QuadTree	BarnesHutTSNE.QuadTree.build(int dim, double[][] data) Construct the quad tree approximation.
private static BarnesHutTSNE.QuadTree	BarnesHutTSNE.QuadTree.build(int dim, double[][] data, int begin, int end) Recursive build function.

Methods in de.lmu.ifi.dbs.elki.algorithm.projection with parameters of type BarnesHutTSNE.QuadTree

Modifier and Type	Method and Description
private double	BarnesHutTSNE.computeRepulsiveForces(double[] rep_i, int off, double[] sol_i, BarnesHutTSNE.QuadTree node) Compute the repulsive forces for a single point

Method parameters in de.lmu.ifi.dbs.elki.algorithm.projection with type arguments of type BarnesHutTSNE.QuadTree

Modifier and Type	Method and Description
private static void	BarnesHutTSNE.QuadTree.splitRecursively(double[][] data, int begin, int end, int initdim, int dims, double[] minmax, java.util.ArrayList<double[]> singletons, java.util.ArrayList<BarnesHutTSNE.QuadTree> children) Build the quadtree by recursive splitting.

Constructors in de.lmu.ifi.dbs.elki.algorithm.projection with parameters of type BarnesHutTSNE.QuadTree

Constructor and Description
QuadTree(double[][] data, BarnesHutTSNE.QuadTree[] children, double[] mid, int weight, double squareSize) Constructor.