pointset.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 POINTSET_H
#define POINTSET_H

#include "qgsgeometry.h"
#include "rtree.hpp"
#include <cfloat>
#include <cmath>
#include <QLinkedList>

namespace pal
{

  class Pal;
  class Projection;
  class LabelPosition;

  class PointSet;

  typedef struct _cHullBox
  {
    double x[4];
    double y[4];

    double alpha;

    double width;
    double length;
  } CHullBox;

  class CORE_EXPORT PointSet
  {
      friend class FeaturePart;
      friend class LabelPosition;
      friend class CostCalculator;
      friend class PolygonCostCalculator;
      friend class Layer;

    public:
      PointSet();
      PointSet( int nbPoints, double *x, double *y );
      virtual ~PointSet();

      PointSet* extractShape( int nbPtSh, int imin, int imax, int fps, int fpe, double fptx, double fpty );

      bool containsPoint( double x, double y ) const;

      bool containsLabelCandidate( double x, double y, double width, double height, double alpha = 0 ) const;

      CHullBox * compute_chull_bbox();

      static void splitPolygons( QLinkedList<PointSet *> &shapes_toProcess,
                                 QLinkedList<PointSet *> &shapes_final,
                                 double xrm, double yrm );

      double minDistanceToPoint( double px, double py, double *rx = nullptr, double *ry = nullptr ) const;

      void getCentroid( double &px, double &py, bool forceInside = false ) const;

      int getGeosType() const { return type; }

      void getBoundingBox( double min[2], double max[2] ) const
      {
        min[0] = xmin;
        min[1] = ymin;
        max[0] = xmax;
        max[1] = ymax;
      }

      PointSet* getHoleOf() { return holeOf; }

      int getNumPoints() const { return nbPoints; }

      void getPointByDistance( double *d, double *ad, double dl, double *px, double *py );

      const GEOSGeometry* geos() const;

      double length() const;

    protected:
      mutable GEOSGeometry *mGeos;
      mutable bool mOwnsGeom;

      int nbPoints;
      double *x;
      double *y;   // points order is counterclockwise

      int *cHull;
      int cHullSize;

      int type;

      PointSet* holeOf;
      PointSet* parent;

      PointSet( double x, double y );

      PointSet( const PointSet &ps );

      void deleteCoords();
      void createGeosGeom() const;
      const GEOSPreparedGeometry* preparedGeom() const;
      void invalidateGeos();

      double xmin;
      double xmax;
      double ymin;
      double ymax;

    private:

      mutable const GEOSPreparedGeometry* mPreparedGeom;

  };

} // namespace pal

#endif