Go to the source code of this file.
◆ g6B()
% Average the values in a bin else g6B |
( |
kk |
| ) |
|
|
pure virtual |
◆ length()
◆ function
Initial value:= binData(
g6C,binMax,bins)
%Bin the
data returned from g6_struct into equi-separated partitions
%
g6C: Matrix containing the g6 values output from g6_struct
% binMax: The maximum binning value
% bins: The number of bins to take
%Returns
% g6B: The binned g6 data
% bin: The bin values of g6B
bin = linspace(0,binMax,bins)
% Indexing needs to % be modified if you wish to use the ordered data sets % Calculate the Voronoi diagram of the resulting data
Definition at line 1 of file binData.m.
◆ g6B
◆ kk
Initial value: idx = find(
g6C(1,:) >= bin(
kk) & g6C(1,:) < bin(
kk+1) )
if length(idx) >0 g6B(kk)
Definition at line 12 of file binData.m.