src/Geo/SearchPointVector.hpp

   1 /* Copyright_License {
   2
   3   XCSoar Glide Computer - http://www.xcsoar.org/
   4   Copyright (C) 2000-2013 The XCSoar Project
   5   A detailed list of copyright holders can be found in the file "AUTHORS".
   6
   7   This program is free software; you can redistribute it and/or
   8   modify it under the terms of the GNU General Public License
   9   as published by the Free Software Foundation; either version 2
  10   of the License, or (at your option) any later version.
  11
  12   This program is distributed in the hope that it will be useful,
  13   but WITHOUT ANY WARRANTY; without even the implied warranty of
  14   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15   GNU General Public License for more details.
  16
  17   You should have received a copy of the GNU General Public License
  18   along with this program; if not, write to the Free Software
  19   Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
  20 }
  21  */
  22
  23 #ifndef SEARCHPOINTVECTOR_HPP
  24 #define SEARCHPOINTVECTOR_HPP
  25
  26 #include "SearchPoint.hpp"
  27
  28 #include <vector>
  29
  30 class FlatRay;
  31 class FlatBoundingBox;
  32 class GeoBounds;
  33
  34 class SearchPointVector: public std::vector<SearchPoint> {
  35 public:
  36   SearchPointVector() = default;
  37   SearchPointVector(const_iterator begin, const_iterator end)
  38     :std::vector<SearchPoint>(begin, end) {}
  39
  40   bool PruneInterior();
  41
  42   gcc_pure
  43   bool IsConvex() const;
  44
  45   /**
  46    * Apply convex pruning algorithm with increasing tolerance
  47    * until the trace is smaller than the given size
  48    *
  49    * @return True if input was modified
  50    */
  51   bool ThinToSize(const unsigned max_size);
  52
  53   void Project(const TaskProjection &tp);
  54
  55   gcc_pure
  56   FlatGeoPoint NearestPoint(const FlatGeoPoint &p) const;
  57
  58   /** Find iterator of nearest point, assuming polygon is convex */
  59   gcc_pure
  60   const_iterator NearestIndexConvex(const FlatGeoPoint &p) const;
  61
  62   gcc_pure
  63   bool IntersectsWith(const FlatRay &ray) const;
  64
  65   gcc_pure
  66   FlatBoundingBox CalculateBoundingbox() const;
  67
  68   gcc_pure
  69   GeoBounds CalculateGeoBounds() const;
  70
  71   /** increment iterator, wrapping around to start if required */
  72   gcc_pure
  73   const_iterator NextCircular(const_iterator i) const;
  74
  75   /** decreement iterator, wrapping around to last item if required */
  76   gcc_pure
  77   const_iterator PreviousCircular(const_iterator i) const;
  78
  79   /** Is the given GeoPoint inside the polygon of SearchPoints? */
  80   gcc_pure
  81   bool IsInside(const GeoPoint &pt) const;
  82
  83   /** Is the given FlatGeoPoint inside the polygon of SearchPoints? */
  84   gcc_pure
  85   bool IsInside(const FlatGeoPoint &pt) const;
  86 };
  87
  88 #endif