costcalculator.h

Go to the documentation of this file.

/***************************************************************************
    costcalculator.h
    ---------------------
    begin                : November 2009
    copyright            : (C) 2009 by Martin Dobias
    email                : wonder dot sk at gmail dot com
 ***************************************************************************
 *                                                                         *
 *   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.                                   *
 *                                                                         *
 ***************************************************************************/
#ifndef COSTCALCULATOR_H
#define COSTCALCULATOR_H
 
 
#include "palrtree.h"
 
#include <QList>
 
#define SIP_NO_FILE

 
namespace pal
{
  class Feats;
  class LabelPosition;
  class Pal;
  class FeaturePart;
  class PointSet;

  class CostCalculator
  {
    public:
      static void addObstacleCostPenalty( pal::LabelPosition *lp, pal::FeaturePart *obstacle, Pal *pal );

      static void calculateCandidatePolygonRingDistanceCosts( std::vector<std::unique_ptr<pal::LabelPosition> > &lPos, double bbx[4], double bby[4] );

      static void calculateCandidatePolygonCentroidDistanceCosts( pal::FeaturePart *feature, std::vector<std::unique_ptr<pal::LabelPosition> > &lPos );

      static double calculatePolygonRingDistance( LabelPosition *candidate, double bbx[4], double bby[4] );

      static void finalizeCandidatesCosts( Feats *feat, double bbx[4], double bby[4] );

      static bool candidateSortGrow( const std::unique_ptr<pal::LabelPosition> &c1, const std::unique_ptr<pal::LabelPosition> &c2 );
  };

  class CandidatePolygonRingDistanceCalculator
  {
    public:
      explicit CandidatePolygonRingDistanceCalculator( LabelPosition *candidate );

      void addRing( const pal::PointSet *ring );

      double minimumDistance() const;
 
    private:
      double mPx;
      double mPy;
      double mMinDistance = std::numeric_limits<double>::max();
  };
} //namespace pal
 
#endif // COSTCALCULATOR_H