parExQHV
Compute Exclusive HyperVolumes using threads
|
Inclusion Exclusion Algorithm better than HSO for high d and small n. More...
Go to the source code of this file.
Functions | |
void | IECinit (void) |
double | exInExClusion (point *zero, point *one, int n, int *idx, point *PS, double *exHV, struct iex *ax) |
Inclusion Exclusion Algorithm better than HSO for high d and small n.
Definition in file inexclusion.h.
double exInExClusion | ( | point * | zero, |
point * | one, | ||
int | n, | ||
int * | idx, | ||
point * | PS, | ||
double * | exHV, | ||
struct iex * | ax | ||
) |
zero | The min coordinates point |
one | The max coordinates point |
n | The number of points |
idx | The idx array |
PS | The point array |
< Number of bits set to 1 in i
< Total volume
< Temporary volume
< Upper limit
< Running through all combinations
< Exclusion
Definition at line 185 of file inexclusion.c.
void IECinit | ( | void | ) |
This algorithm also needs to be initialized
Calculating the binomials
Accumulating the binomials
Definition at line 70 of file inexclusion.c.