types.h

Go to the documentation of this file.

#ifndef POLY_TYPES_H
#define POLY_TYPES_H

#include <utility>
#include <list>
#include <set>
#include <data/types.h>
#include <data/linkedlist.h>
#include <QDebug>
#include <QLineF>

namespace frechet {

using namespace data;

namespace poly {

static const int SOUTH_POLE_INDEX = -2;

class Segment: public std::pair<int,int>
{
public:
    Segment() : std::pair<int,int> (-1,-1) { }
    Segment(int i, int j)
    {
        first = std::min(i,j);
        second = std::max(i,j);
        Q_ASSERT((first>=0 || first==SOUTH_POLE_INDEX) && second>=0);
    }
    bool empty() const {
        return first==second;
    }
    bool is_diagonal(int n) const {
        return ! is_edge(n);
    }
    bool is_edge(int n) const {
        return (second==(first+1)) || ((first==0) && (second==(n-1)));
    }
    bool operator< (const Segment& that) const
    {
        if (this->first != that.first)
            return this->first < that.first;
        else
            return this->second > that.second;
    }
    QLineF map(const Curve& curve) const {
        return QLineF(map(curve,first),map(curve,second));
    }
    static QPointF map(const Curve& curve, int i) {
        return curve[i % (curve.size()-1)];
    }
};

typedef std::vector<int> Polygon;
typedef std::set<Segment> Segments;
typedef std::list<Polygon> Partition;

std::ostream& operator<< (std::ostream& out, const Segment& seg);

} } //  namespace frechet::poly

#endif // POLY_TYPES_H