exQHV
Compute Exclusive HyperVolumes sequentially
|
The PTS array is where I store the points. The combinations are simply integers. The bits to one indicate the points included in the combination. The C2P array maps from combinations to positions in PTS. More...
#include <stdio.h>
#include <assert.h>
#include <stdlib.h>
#include <string.h>
#include <strings.h>
#include "point.h"
#include "quickhvolume.h"
#include "macros.h"
#include "subsets.h"
#include "inexclusion.h"
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) |
The PTS array is where I store the points. The combinations are simply integers. The bits to one indicate the points included in the combination. The C2P array maps from combinations to positions in PTS.
Definition in file inexclusion.c.
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 177 of file inexclusion.c.
void IECinit | ( | void | ) |
This algorithm also needs to be initialized
Calculating the binomials
Accumulating the binomials
Definition at line 74 of file inexclusion.c.