DigitalShapesDecorator.h

 
#pragma once

 
#if defined(DigitalShapesDecorator_RECURSES)
#error Recursive header files inclusion detected in DigitalShapesDecorator.h
#else // defined(DigitalShapesDecorator_RECURSES)
#define DigitalShapesDecorator_RECURSES
 
#if !defined DigitalShapesDecorator_h
#define DigitalShapesDecorator_h

// Inclusions
#include <iostream>
#include "DGtal/base/Common.h"
#include "DGtal/base/ConstAlias.h"
 
#include "DGtal/shapes/CDigitalBoundedShape.h"
#include "DGtal/shapes/CDigitalOrientedShape.h"
 
namespace DGtal
{

  // template class DigitalShapesCSG
  template <typename ShapeA, typename ShapeB>
  class DigitalShapesCSG
  {
  protected:
    enum e_operator
    {
      e_plus,
      e_intersection,
      e_minus
    };
 
  public:
    BOOST_CONCEPT_ASSERT (( concepts::CDigitalBoundedShape< ShapeA > ));
    BOOST_CONCEPT_ASSERT (( concepts::CDigitalOrientedShape< ShapeA > ));
 
    typedef typename ShapeA::Space Space;
    typedef typename ShapeA::Point Point;

    DigitalShapesCSG( )
      : bIsValid(false)
    {}

    DigitalShapesCSG ( const DigitalShapesCSG & other )
      : myShapeA(other.myShapeA), v_shapes(other.v_shapes),
        myLowerBound(other.myLowerBound), myUpperBound(other.myUpperBound),
        bIsValid(other.bIsValid)
    {}
 

    DigitalShapesCSG( ConstAlias<ShapeA> a )
      : myShapeA( a )
    {
      myLowerBound = myShapeA->getLowerBound();
      myUpperBound = myShapeA->getUpperBound();
 
      bIsValid = true;
    }

    DigitalShapesCSG & operator= ( const DigitalShapesCSG & other )
    {
      myShapeA = other.myShapeA;
      v_shapes = other.v_shapes;
 
      myLowerBound = other.myLowerBound;
      myUpperBound = other.myUpperBound;
 
      bIsValid = other.bIsValid;
 
      return *this;
    }

    void setParams( ConstAlias<ShapeA> a )
    {
      myShapeA = a;
 
      myLowerBound = myShapeA->getLowerBound();
      myUpperBound = myShapeA->getUpperBound();
 
      bIsValid = true;
    }

    void plus( ConstAlias<ShapeB> b )
    {
      BOOST_CONCEPT_ASSERT (( concepts::CDigitalBoundedShape< ShapeB > ));
      BOOST_CONCEPT_ASSERT (( concepts::CDigitalOrientedShape< ShapeB > ));
 
      FATAL_ERROR_MSG( isValid(), "Operation invalid. Maybe you don't set a ShapeA object." );
 
      std::pair<e_operator, CountedConstPtrOrConstPtr< ShapeB > > shape( e_plus, b );
 
      for(Dimension i =0; i < Space::dimension; ++i)
      {
        myLowerBound[i] = std::min(myLowerBound[i], b->getLowerBound()[i]);
        myUpperBound[i] = std::max(myUpperBound[i], b->getUpperBound()[i]);
      }
 
      v_shapes.push_back(shape);
    }

    void intersection( ConstAlias<ShapeB> b )
    {
      BOOST_CONCEPT_ASSERT (( concepts::CDigitalBoundedShape< ShapeB > ));
      BOOST_CONCEPT_ASSERT (( concepts::CDigitalOrientedShape< ShapeB > ));
 
      FATAL_ERROR_MSG( isValid(), "Operation invalid. Maybe you don't set a ShapeA object." );
 
      std::pair<e_operator, CountedConstPtrOrConstPtr< ShapeB > > shape( e_intersection, b );
 
      for(Dimension i=0; i < Space::dimension; ++i)
      {
        myLowerBound[i] = std::max(myLowerBound[i], b->getLowerBound()[i]);
        myUpperBound[i] = std::min(myUpperBound[i], b->getUpperBound()[i]);
      }
 
      v_shapes.push_back(shape);
    }

    void minus( ConstAlias<ShapeB> b )
    {
      BOOST_CONCEPT_ASSERT (( concepts::CDigitalBoundedShape< ShapeB > ));
      BOOST_CONCEPT_ASSERT (( concepts::CDigitalOrientedShape< ShapeB > ));
 
      FATAL_ERROR_MSG( isValid(), "Operation invalid. Maybe you don't set a ShapeA object." );
 
      std::pair<e_operator, CountedConstPtrOrConstPtr< ShapeB > > shape( e_minus, b );
 
      v_shapes.push_back(shape);
 
    }

    Point getLowerBound() const
    {
      FATAL_ERROR_MSG( isValid(), "Operation invalid. Maybe you don't set a ShapeA object." );
 
      return myLowerBound;
    }

    Point getUpperBound() const
    {
      FATAL_ERROR_MSG( isValid(), "Operation invalid. Maybe you don't set a ShapeA object." );
 
      return myUpperBound;
    }

    Orientation orientation( const Point & p ) const
    {
      FATAL_ERROR_MSG( isValid(), "Operation invalid. Maybe you don't set a ShapeA object." );
 
      Orientation orient = myShapeA->orientation( p );
 
      for(unsigned int i = 0; i < v_shapes.size(); ++i)
      {
        if( v_shapes[i].first == e_minus )
        {
          if (( v_shapes[i].second->orientation( p ) == INSIDE ) || ( v_shapes[i].second->orientation( p ) == ON ))
          {
            orient = OUTSIDE;
          }
        }
        else if( v_shapes[i].first == e_intersection )
        {
          if (( orient == ON ) && ( v_shapes[i].second->orientation( p ) != OUTSIDE ))
          {
            orient = ON;
          }
          else if (( v_shapes[i].second->orientation( p ) == ON ) && ( orient != OUTSIDE ))
          {
            orient = ON;
          }
          else if (( orient == INSIDE ) && ( v_shapes[i].second->orientation( p ) == INSIDE ))
          {
            orient = INSIDE;
          }
          else
          {
            orient = OUTSIDE;
          }
        }
        else 
        {
          if (( orient == INSIDE ) || ( v_shapes[i].second->orientation( p ) == INSIDE ))
          {
            orient = INSIDE;
          }
          else if (( orient == ON ) || ( v_shapes[i].second->orientation( p ) == ON ))
          {
            orient = ON;
          }
          else
          {
            orient = OUTSIDE;
          }
        }
      }
 
      return orient;
    }
 
  public:

    void selfDisplay ( std::ostream & out ) const;

    bool isValid() const
    {
      return bIsValid;
    }
 
    // ------------------------- Internals ------------------------------------
  private:

    CountedConstPtrOrConstPtr< ShapeA > myShapeA;

    std::vector< std::pair<e_operator,  CountedConstPtrOrConstPtr< ShapeB > > > v_shapes;

    Point myLowerBound;

    Point myUpperBound;

    bool bIsValid;
 
  };
} // namespace DGtal
 
 
 
#endif // !defined DigitalShapesDecorator_h
 
#undef DigitalShapesDecorator_RECURSES
#endif // else defined(DigitalShapesDecorator_RECURSES)