feature.h

Go to the documentation of this file.

/*
 *   libpal - Automated Placement of Labels Library
 *
 *   Copyright (C) 2008 Maxence Laurent, MIS-TIC, HEIG-VD
 *                      University of Applied Sciences, Western Switzerland
 *                      http://www.hes-so.ch
 *
 *   Contact:
 *      maxence.laurent <at> heig-vd <dot> ch
 *    or
 *      eric.taillard <at> heig-vd <dot> ch
 *
 * This file is part of libpal.
 *
 * libpal 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 3 of the License, or
 * (at your option) any later version.
 *
 * libpal 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 libpal.  If not, see <http://www.gnu.org/licenses/>.
 *
 */

#ifndef FEATURE_H
#define FEATURE_H

#include "qgsgeometry.h"
#include "pointset.h"
#include "util.h"
#include "labelposition.h"
#include <iostream>
#include <fstream>
#include <cmath>
#include <QString>

#include "qgslabelfeature.h"

namespace pal
{
  class CORE_EXPORT LabelInfo
  {
    public:
      typedef struct
      {
        double width;
      } CharacterInfo;

      LabelInfo( int num, double height, double maxinangle = 20.0, double maxoutangle = -20.0 )
      {
        max_char_angle_inside = maxinangle;
        // outside angle should be negative
        max_char_angle_outside = maxoutangle > 0 ? -maxoutangle : maxoutangle;
        label_height = height;
        char_num = num;
        char_info = new CharacterInfo[num];
      }
      ~LabelInfo() { delete [] char_info; }

      double max_char_angle_inside;
      double max_char_angle_outside;
      double label_height;
      int char_num;
      CharacterInfo* char_info;
    private:

      LabelInfo( const LabelInfo& rh );
      LabelInfo& operator=( const LabelInfo& rh );
  };

  class LabelPosition;
  class FeaturePart;

  class CORE_EXPORT FeaturePart : public PointSet
  {

    public:

      FeaturePart( QgsLabelFeature* lf, const GEOSGeometry* geom );

      FeaturePart( const FeaturePart& other );

      virtual ~FeaturePart();

      QgsLabelFeature* feature() { return mLF; }

      Layer* layer();

      QgsFeatureId featureId() const;

      int createCandidates( QList<LabelPosition *> &lPos, double bboxMin[2], double bboxMax[2], PointSet *mapShape, RTree<LabelPosition*, double, 2, double>* candidates );

      int createCandidatesAroundPoint( double x, double y, QList<LabelPosition *> &lPos, double angle, PointSet *mapShape = nullptr );

      int createCandidatesOverPoint( double x, double y, QList<LabelPosition *> &lPos, double angle, PointSet *mapShape = nullptr );

      int createCandidatesAtOrderedPositionsOverPoint( double x, double y, QList<LabelPosition *> &lPos, double angle );

      int createCandidatesAlongLine( QList<LabelPosition *> &lPos, PointSet *mapShape );

      LabelPosition* curvedPlacementAtOffset( PointSet* path_positions, double* path_distances,
                                              int orientation, int index, double distance );

      int createCurvedCandidatesAlongLine( QList<LabelPosition *> &lPos, PointSet* mapShape );

      int createCandidatesForPolygon( QList<LabelPosition *> &lPos, PointSet *mapShape );

      bool hasSameLabelFeatureAs( FeaturePart* part ) const;

#if 0

      void print();
#endif

      double getLabelWidth() const { return mLF->size().width(); }
      double getLabelHeight() const { return mLF->size().height(); }
      double getLabelDistance() const { return mLF->distLabel(); }

      bool getFixedRotation() { return mLF->hasFixedAngle(); }
      double getLabelAngle() { return mLF->fixedAngle(); }
      bool getFixedPosition() { return mLF->hasFixedPosition(); }
      bool getAlwaysShow() { return mLF->alwaysShow(); }
      bool isObstacle() { return mLF->isObstacle(); }
      double obstacleFactor() { return mLF->obstacleFactor(); }
      double repeatDistance() { return mLF->repeatDistance(); }

      int getNumSelfObstacles() const { return mHoles.count(); }
      FeaturePart* getSelfObstacle( int i ) { return mHoles.at( i ); }

      bool isConnected( FeaturePart* p2 );

      bool mergeWithFeaturePart( FeaturePart* other );

      void addSizePenalty( int nbp, QList<LabelPosition *> &lPos, double bbx[4], double bby[4] );

      double calculatePriority() const;


    protected:

      QgsLabelFeature* mLF;
      QList<FeaturePart*> mHoles;

      void extractCoords( const GEOSGeometry* geom );

    private:

      LabelPosition::Quadrant quadrantFromOffset() const;
  };

} // end namespace pal

#endif