h o m e

d o c u m e n t a t i o n

c l a s s h i e r a r c h y

---

Predicates1D.h

//
//  Filename         : Predicates1D.h
//  Author(s)        : Stephane Grabli, Emmanuel Turquin
//  Purpose          : Class gathering stroke creation algorithms
//  Date of creation : 01/07/2003
//


//
//  Copyright (C) : Please refer to the COPYRIGHT file distributed 
//   with this source distribution. 
//
//  This program is free software; you can redistribute it and/or
//  modify it under the terms of the GNU General Public License
//  as published by the Free Software Foundation; either version 2
//  of the License, or (at your option) any later version.
//
//  This program is distributed in the hope that it will be useful,
//  but WITHOUT ANY WARRANTY; without even the implied warranty of
//  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
//  GNU General Public License for more details.
//
//  You should have received a copy of the GNU General Public License
//  along with this program; if not, write to the Free Software
//  Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
//

#ifndef  PREDICATES1D_H
# define PREDICATES1D_H

# include <string>
# include "../system/TimeStamp.h"
# include "../view_map/Interface1D.h"
# include "../view_map/Functions1D.h"
# include "AdvancedFunctions1D.h"

//
// UnaryPredicate1D (base class for predicates in 1D)
//

class UnaryPredicate1D
{
public:
  UnaryPredicate1D() {}
  virtual ~UnaryPredicate1D() {}
  virtual string getName() const {
    return "UnaryPredicate1D";
  }
  virtual bool operator()(Interface1D& inter) {
    cerr << "Warning: operator() not implemented" << endl;
    return false;
  }
};


//
// BinaryPredicate1D (base class for predicates in 1D)
//

class BinaryPredicate1D
{
public:
  BinaryPredicate1D() {}
  virtual ~BinaryPredicate1D() {}
  virtual string getName() const {
    return "BinaryPredicate1D";
  }
  virtual bool operator()(Interface1D& inter1, Interface1D& inter2) {
    cerr << "Warning: operator() not implemented" << endl;
    return false;
  }
};


//
// Predicates definitions
//

namespace Predicates1D {

  // TrueUP1D
  class TrueUP1D : public UnaryPredicate1D
  {
  public:
    TrueUP1D() {}
    string getName() const {
      return "TrueUP1D";
    }
    bool operator()(Interface1D&) {
      return true;
    }
  };

  // FalseUP1D
  class FalseUP1D : public UnaryPredicate1D
  {
  public:
    FalseUP1D() {}
    string getName() const {
      return "FalseUP1D";
    }
    bool operator()(Interface1D&) {
      return false;
    }
  };

  // QuantitativeInvisibilityUP1D
  class QuantitativeInvisibilityUP1D : public UnaryPredicate1D
  {
  public:
    QuantitativeInvisibilityUP1D(unsigned qi = 0) : _qi(qi) {}
    string getName() const {
      return "QuantitativeInvisibilityUP1D";
    }
    bool operator()(Interface1D& inter) {
      Functions1D::QuantitativeInvisibilityF1D func;
      return (func(inter) == _qi);
    }
  private:
    unsigned _qi;
  };

  // ContourUP1D
  class ContourUP1D : public UnaryPredicate1D
  {
  private:
    Functions1D::CurveNatureF1D _getNature;
  public:
    string getName() const {
      return "ContourUP1D";
    }
    bool operator()(Interface1D& inter) {
      if((_getNature(inter) & Nature::SILHOUETTE) || (_getNature(inter) & Nature::BORDER)){
        Interface0DIterator it=inter.verticesBegin();
        for(; !it.isEnd(); ++it){
          if(Functions0D::getOccludeeF0D(it) != Functions0D::getShapeF0D(it))
            return true;
        }
      }
      return false;
    }
  };

  // ExternalContourUP1D
  class ExternalContourUP1D : public UnaryPredicate1D
  {
  private:
    Functions1D::CurveNatureF1D _getNature;
  public:
    string getName() const {
      return "ExternalContourUP1D";
    }
    bool operator()(Interface1D& inter) {
      if((_getNature(inter) & Nature::SILHOUETTE) || (_getNature(inter) & Nature::BORDER)){
        set<ViewShape*> occluded;
        Functions1D::getOccludeeF1D(inter, occluded);
        for(set<ViewShape*>::iterator os=occluded.begin(), osend=occluded.end();
            os!=osend;
            ++os){
          if((*os) == 0)
            return true;
        }
      }
      return false;
    }
  };

  // EqualToTimeStampUP1D
  class EqualToTimeStampUP1D : public UnaryPredicate1D
  {
  protected:
    unsigned _timeStamp; 
  public:
    EqualToTimeStampUP1D(unsigned ts) : UnaryPredicate1D(){
      _timeStamp = ts;
    }
    string getName() const {
      return "EqualToTimeStampUP1D";
    }
    bool operator()(Interface1D& inter) {
      return (inter.getTimeStamp() == _timeStamp);
    }
  };

  // EqualToChainingTimeStampUP1D
  class EqualToChainingTimeStampUP1D : public UnaryPredicate1D
  {
  protected:
    unsigned _timeStamp; 
  public:
    EqualToChainingTimeStampUP1D(unsigned ts) : UnaryPredicate1D(){
      _timeStamp = ts;
    }
    string getName() const {
      return "EqualToChainingTimeStampUP1D";
    }
    bool operator()(Interface1D& inter) {
      ViewEdge* edge = dynamic_cast<ViewEdge*>(&inter);
      if (!edge)
        return false;
      return (edge->getChainingTimeStamp() >= _timeStamp);
    }
  };

  // ShapeUP1D
  class ShapeUP1D: public UnaryPredicate1D
  {
  private:
    Id _id;
  public:
    ShapeUP1D(unsigned idFirst, unsigned idSecond=0) 
      : UnaryPredicate1D(){
      _id = Id(idFirst, idSecond);
    }
    string getName() const {
      return "ShapeUP1D";
    }
    bool operator()(Interface1D& inter) {
      set<ViewShape*> shapes;
      Functions1D::getShapeF1D(inter, shapes);
      for(set<ViewShape*>::iterator s=shapes.begin(), send=shapes.end();
      s!=send;
      ++s){
        if((*s)->getId() == _id)
          return true;
      }
      return false;
    }
  };
  
  //
  //   Binary Predicates definitions
  //

  // TrueBP1D
  class TrueBP1D : public BinaryPredicate1D
  {
  public:
    string getName() const {
      return "TrueBP1D";
    }
    bool operator()(Interface1D& i1, Interface1D& i2) {
      return true;
    }
  };

  // FalseBP1D
  class FalseBP1D : public BinaryPredicate1D
  {
  public:
    string getName() const {
      return "FalseBP1D";
    }
    bool operator()(Interface1D& i1, Interface1D& i2) {
      return false;
    }
  };
  
  // Length2DBP1D
  class Length2DBP1D : public BinaryPredicate1D
  {
  public:
    string getName() const {
      return "Length2DBP1D";
    }
    bool operator()(Interface1D& i1, Interface1D& i2) {
      return (i1.getLength2D() > i2.getLength2D());
    }
  };

  // SameShapeIdBP1D
  class SameShapeIdBP1D : public BinaryPredicate1D
  {
  public:
    string getName() const {
      return "SameShapeIdBP1D";
    }
    bool operator()(Interface1D& i1, Interface1D& i2) {
      set<ViewShape*> shapes1;
      Functions1D::getShapeF1D(i1, shapes1);
      set<ViewShape*> shapes2;
      Functions1D::getShapeF1D(i2, shapes2);
      // FIXME:// n2 algo, can do better...
      for(set<ViewShape*>::iterator s=shapes1.begin(), send=shapes1.end();
          s!=send;
          ++s){
        Id current = (*s)->getId();
        for(set<ViewShape*>::iterator s2=shapes2.begin(), s2end=shapes2.end();
          s2!=s2end;
          ++s2){
          if((*s2)->getId() == current)
            return true;
        }
      }
      return false;
    }
  };

  // ViewMapGradientNormBP1D
  class ViewMapGradientNormBP1D : public BinaryPredicate1D
  {
  private:
    Functions1D::GetViewMapGradientNormF1D _func;
  public:
    ViewMapGradientNormBP1D(int level, IntegrationType iType=MEAN, float sampling=2.0) 
      : BinaryPredicate1D(), _func(level, iType, sampling) {
    }
    string getName() const {
      return "ViewMapGradientNormBP1D";
    }
    bool operator()(Interface1D& i1, Interface1D& i2) {
      return (_func(i1) > _func(i2));
    }
  };
} // end of namespace Predicates1D

#endif // PREDICATES1D_H

---

Last modified 3 Mar 2008

© Stephane Grabli