trianglepartition.h

Go to the documentation of this file.

#ifndef TRIANGLEPARTITION_H
#define TRIANGLEPARTITION_H

#include <halfspaceD2.h>
#include <partitionspace.h>
#include <typedefs.h>

template< typename T, typename D >
class trianglepartition : public partitionspace<T>
{
public:

  T pi[3];

  halfspaceD2<T,D> hi[3];


  trianglepartition
  (
    T const & p0_,
    T const & p1_,
    T const & p2_
  );
  trianglepartition() {}
  void construct
  (
    T const & p0_,
    T const & p1_,
    T const & p2_
  );

  boolc isInside( T const & a) const;

};




// -------------------------------------------------------- 
// Implementation

template< typename T, typename D >
trianglepartition<T,D>::trianglepartition
( 
  T const & p0_,
  T const & p1_,
  T const & p2_
) 
{
  construct(p0_,p1_,p2_);
}

template< typename T, typename D >
void trianglepartition<T,D>::construct
(
  T const & p0_,
  T const & p1_,
  T const & p2_
) 
{
  pi[0] = p0_;
  pi[1] = p1_;
  pi[2] = p2_;

  hi[0] = halfspaceD2<T,D>(pi[0],pi[1]); 
  hi[1] = halfspaceD2<T,D>(pi[1],pi[2]); 
  hi[2] = halfspaceD2<T,D>(pi[2],pi[0]);
} 

template< typename T, typename D >
boolc trianglepartition<T,D>::isInside( T const & x ) const
{
  for (uint i=0; i<3; ++i)
    if (!hi[i].isInside(x))
      return false;

  return true;
}


#endif