parExQHV
Compute Exclusive HyperVolumes using threads
 All Data Structures Files Functions Variables Macros
inexclusion.h File Reference

Inclusion Exclusion Algorithm better than HSO for high d and small n. More...

#include "point.h"
#include "tdata.h"
Include dependency graph for inexclusion.h:
This graph shows which files directly or indirectly include this file:

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)
 

Detailed Description

Inclusion Exclusion Algorithm better than HSO for high d and small n.

Author
Luis Russo <lsr-ThinkPad-X201>
Date
Fri Feb 3 16:30:06 2012

Definition in file inexclusion.h.

Function Documentation

double exInExClusion ( point zero,
point one,
int  n,
int *  idx,
point PS,
double *  exHV,
struct iex *  ax 
)
Parameters
zeroThe min coordinates point
oneThe max coordinates point
nThe number of points
idxThe idx array
PSThe point array
Returns
The hyperVolume computed with cache-oblivious IEC

< 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.