labelposition.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 LABELPOSITION_H
#define LABELPOSITION_H

#define SIP_NO_FILE


#include "qgis_core.h"
#include "pointset.h"
#include "palrtree.h"
#include <fstream>

namespace pal
{

  class FeaturePart;
  class Pal;
  class Label;


  class CORE_EXPORT LabelPosition : public PointSet
  {
      friend class CostCalculator;
      friend class PolygonCostCalculator;

    public:

      enum Quadrant
      {
        QuadrantAboveLeft,
        QuadrantAbove,
        QuadrantAboveRight,
        QuadrantLeft,
        QuadrantOver,
        QuadrantRight,
        QuadrantBelowLeft,
        QuadrantBelow,
        QuadrantBelowRight
      };

      LabelPosition( int id, double x1, double y1,
                     double w, double h,
                     double alpha, double cost,
                     FeaturePart *feature, bool isReversed = false, Quadrant quadrant = QuadrantOver );

      LabelPosition( const LabelPosition &other );

      bool isIn( double *bbox );

      bool isIntersect( double *bbox );

      bool intersects( const GEOSPreparedGeometry *geometry );

      bool within( const GEOSPreparedGeometry *geometry );

      bool isInside( double *bbox );

      bool isInConflict( const LabelPosition *ls ) const;

      void getBoundingBox( double amin[2], double amax[2] ) const;

      double getDistanceToPoint( double xp, double yp ) const;

      bool crossesLine( PointSet *line ) const;

      bool crossesBoundary( PointSet *polygon ) const;

      int polygonIntersectionCost( PointSet *polygon ) const;

      bool intersectsWithPolygon( PointSet *polygon ) const;

      void offsetPosition( double xOffset, double yOffset );

      int getId() const;


      FeaturePart *getFeaturePart() const;

      int getNumOverlaps() const { return nbOverlap; }
      void resetNumOverlaps() { nbOverlap = 0; } // called from problem.cpp, pal.cpp

      void incrementNumOverlaps() { nbOverlap++; }

      void decrementNumOverlaps() { nbOverlap++; }

      int getProblemFeatureId() const { return probFeat; }

      void setProblemIds( int probFid, int lpId )
      {
        probFeat = probFid;
        id = lpId;
        if ( mNextPart ) mNextPart->setProblemIds( probFid, lpId );
      }

      double cost() const { return mCost; }

      void setCost( double newCost ) { mCost = newCost; }

      void setConflictsWithObstacle( bool conflicts );

      bool conflictsWithObstacle() const { return mHasObstacleConflict; }

      void setHasHardObstacleConflict( bool conflicts );

      bool hasHardObstacleConflict() const { return mHasHardConflict; }

      void validateCost();

      double getX( int i = 0 ) const;

      double getY( int i = 0 ) const;

      double getWidth() const { return w; }
      double getHeight() const { return h; }

      double getAlpha() const;
      bool getReversed() const { return reversed; }
      bool getUpsideDown() const { return upsideDown; }

      Quadrant getQuadrant() const { return quadrant; }

      LabelPosition *nextPart() const { return mNextPart.get(); }

      void setNextPart( std::unique_ptr< LabelPosition > next ) { mNextPart = std::move( next ); }

      // -1 if not multi-part
      int getPartId() const { return partId; }
      void setPartId( int id ) { partId = id; }

      int incrementUpsideDownCharCount() { return ++mUpsideDownCharCount; }

      int upsideDownCharCount() const { return mUpsideDownCharCount; }

      void removeFromIndex( PalRtree<LabelPosition> &index );

      void insertIntoIndex( PalRtree<LabelPosition> &index );

    protected:

      int id;

      FeaturePart *feature = nullptr;

      // bug # 1 (maxence 10/23/2008)
      int probFeat;

      int nbOverlap;

      double alpha;
      double w;
      double h;

      int partId;

      //True if label direction is the same as line / polygon ring direction.
      //Could be used by the application to draw a directional arrow ('<' or '>')
      //if the layer arrangement is P_LINE
      bool reversed;

      bool upsideDown;

      LabelPosition::Quadrant quadrant;

    private:

      std::unique_ptr< LabelPosition > mNextPart;

      double mCost;
      bool mHasObstacleConflict;
      bool mHasHardConflict = false;
      int mUpsideDownCharCount;

      int partCount() const;

      double polygonIntersectionCostForParts( PointSet *polygon ) const;

      bool isInConflictSinglePart( const LabelPosition *lp ) const;
      bool isInConflictMultiPart( const LabelPosition *lp ) const;

  };

} // end namespace

#endif