This is where navigation should be.


GSP_NN_HYPERGRAPH - Create a nearest neighbors hypergraph from a point cloud

Usage

:  G = gsp_nn_hypergraph( Xin );
G = gsp_nn_hypergraph( Xin, param );

Input parameters

Xin Input points
param Structure of optional parameters

Output parameters

G Resulting graph

Example:

P = rand(100,2);
G = gsp_nn_hypergraph(P)

This code produces the following output:

G =

  struct with fields:

             N: 100
            Ne: 1000
             W: [100×100 double]
             E: {100×1 cell}
    hypergraph: 1
      directed: 1
        coords: [100×2 double]
          type: 'Nearest neighboors hypergraph'
      lap_type: 'normalized'
         sigma: 0.0584
             A: [100×100 double]
            de: [100×1 double]
            dv: [100×1 double]
             L: [100×100 double]
             d: [100×1 double]
      plotting: [1×1 struct]

Description

Additional parameters

  • param.use_flann : [0, 1] use the FLANN library
  • param.center : [0, 1] center the data
  • param.rescale : [0, 1] rescale the data (in a 1-ball)
  • param.sigma : float the variance of the distance kernel
  • param.k : int number of neighbors for knn