codac2_qinter.h

Go to the documentation of this file.

 
#pragma once
 
#include <list>
#include "codac2_IntervalVector.h"
 
namespace codac2
{
  // Approximate Q-intersection, using Luc Jaulin's algorithm
  // Author: Clement Carbonnel, Benoit Desrochers, Simon Rohou
  // The q-intersection of n boxes corresponds to the set of all elements
  // which belong to at least q of these boxes.
  IntervalVector qinter(unsigned int q, const std::list<IntervalVector>& l);
}