Information for a Node definition. This data structure saves the information related for a virtual internal node.
The variables have the meaning given for the kdnode
data structure. The points that are virtually contained in the loson
and hison
are represented by indexes that are in the range perm[lopt_l,hipt_l]
and perm[lopt_h,hipt_h]
, respectively.
More...
#include <tdkdtree.h>
Data Fields | |
int | cutdim |
double | cutval |
int | lopt_l |
int | hipt_l |
int | lopt_h |
int | hipt_h |
Information for a Node definition. This data structure saves the information related for a virtual internal node.
The variables have the meaning given for the kdnode
data structure. The points that are virtually contained in the loson
and hison
are represented by indexes that are in the range perm[lopt_l,hipt_l]
and perm[lopt_h,hipt_h]
, respectively.
Definition at line 61 of file tdkdtree.h.
int cutdim |
Definition at line 63 of file tdkdtree.h.
double cutval |
Definition at line 64 of file tdkdtree.h.
int hipt_h |
Definition at line 68 of file tdkdtree.h.
int hipt_l |
Definition at line 66 of file tdkdtree.h.
int lopt_h |
Definition at line 67 of file tdkdtree.h.
int lopt_l |
Definition at line 65 of file tdkdtree.h.