DSLSubsegment.h

#pragma once

#if defined(DSLSubsegment_RECURSES)
#error Recursive header files inclusion detected in DSLSubsegment.h
#else // defined(DSLSubsegment_RECURSES)

#define DSLSubsegment_RECURSES

#if !defined DSLSubsegment_h

#define DSLSubsegment_h

// Inclusions
#include <iostream>
#include <exception>
#include <iomanip>
#include "DGtal/base/Common.h"

#include "DGtal/arithmetic/IntegerComputer.h"

namespace DGtal
{

// class DSLSubsegment



  template <typename TInteger, typename TNumber>
    class DSLSubsegment
  {
      // ----------------------- Standard services ------------------------------
    public:

      ~DSLSubsegment(){};

    // ----------------------- Interface --------------------------------------
    public:

      void selfDisplay ( std::ostream & out ) const;

      bool isValid() const;

      typedef TNumber Number;
      typedef TInteger Integer;
      typedef long double LongDoubleType;


      typedef DGtal::PointVector<2,Integer> Ray;

      typedef DGtal::PointVector<2,Integer> Point;

      typedef DGtal::PointVector<2,Number> PointF;

      typedef DGtal::PointVector<2,Integer> Vector;

      typedef DGtal::PointVector<2,Number> VectorF;

      BOOST_CONCEPT_ASSERT((concepts::CEuclideanRing<Number>));
      BOOST_CONCEPT_ASSERT((concepts::CInteger<Integer>));

  protected:
      Integer myA;

      Integer myB;

      Integer myMu;

      Number myPrecision;

  public:
      DSLSubsegment(Number a, Number b, Number mu, Point &A, Point &B, std::string type);

      DSLSubsegment(Number alpha, Number beta, Point &A, Point &B, Number precision = 1e-10);


  protected:
      void DSLSubsegmentFareyFan(Number a, Number b, Number mu, Point &A, Point &B);

      void DSLSubsegmentLocalCH(Number a, Number b, Number mu, Point &A, Point &B);

      DSLSubsegment();


      class RayC
      {
      public :

        Integer x;

        Integer y;

        RayC();

        RayC(const Integer x0, const Integer y0);

        RayC(const Integer p, const Integer q, const Integer r, const Integer slope);

        ~RayC();

      };

      typedef enum Position
      {
        ABOVE,
        BELOW,
        ONTO
      } Position;


      Integer intersectionVertical(Point &P, Vector &v, Integer n);


      Integer intersection(Point &P, Vector &v, Vector &aL, Integer r);

      Integer intersection(Point &P, Vector &v, Number s);

      void update(Vector &u, Point &A, Vector &l, Integer r, Vector *v);

      void update(Vector &u, Point &A, Number s, Vector *v);

      void lowerConvexHull(Vector &l, Integer mu, Point &A, Point &B,
                           Point *prevInfL, Point *infL, Point *infR, Point *prevInfR);

      void convexHullApprox(Vector &l, Integer r, Integer n, Point *inf, Point *sup);

      void convexHullApprox(Number s, Integer n, Point *inf, Point *sup);

      void convexHullApproxTwoPoints(Vector &l, Integer r, Integer n,
                                     Point *inf, Point *sup, Point *prevInf, Point *prevSup, bool inv);


      void convexHullHarPeled(Vector &l, Integer n, Point *inf, Point *sup);


      Point nextTermInFareySeriesEuclid(Integer fp, Integer fq, Integer n);


      RayC rayOfHighestSlope(Integer p, Integer q, Integer r, Integer smallestSlope, Integer n);

      Integer slope(Integer p, Integer q, Integer r, Number a, Number b, Number mu);

      Integer slope(Integer p, Integer q, Integer r, Number alpha, Number beta);


      Position positionWrtRay(RayC &r, Number a, Number b, Number mu);


      Position positionWrtRay(RayC &r, Number alpha, Number beta);

      RayC smartRayOfSmallestSlope(Integer fp, Integer fq, Integer gp, Integer gq, Integer r);


      Integer smartFirstDichotomy(Integer fp, Integer fq, Integer gp, Integer gq,
                                  Number a, Number b, Number mu, Integer n, bool *flagRayFound);

      Integer smartFirstDichotomy(Integer fp, Integer fq, Integer gp, Integer gq,
                                  Number alpha, Number beta, Integer n, bool *flagRayFound);



      RayC localizeRay(Integer fp, Integer fq, Integer gp, Integer gq,
                       Integer r, Number a, Number b, Number mu, Integer n);
      
      
      RayC localizeRay(Integer fp, Integer fq, Integer gp, Integer gq,
                       Integer r, Number alpha, Number beta, Integer n);


      RayC raySup(Integer fp, Integer fq, RayC r);


      void findSolutionWithoutFractions(Integer fp, Integer fq, Integer gp, Integer gq,
                                        RayC r, Integer n, Integer *resAlphaP,
                                        Integer *resAlphaQ, Integer *resBetaP, bool found);  // resBetaQ = resAlphaQ

      void shortFindSolution(Integer fp, Integer fq, Integer gp, Integer gq,
                             RayC r, Integer n, Integer *resAlphaP, Integer *resAlphaQ,
                             Integer *resBetaP);  // resBetaQ = resAlphaQ


  public :
      Integer computeMinRemainder(Number a, Number b, Number mu, Point A, Point B);
      Integer computeMaxRemainder(Number a, Number b, Number mu, Point A, Point B);


      // ------------------------- Accessors ------------------------------

  public:

      Integer getA() const;
      Integer getB() const;
      Integer getMu() const;


  };


}// namespace DGtal



  //Includes inline functions.
#include "DSLSubsegment.ih"


//                                                                           //

#endif // !defined DSLSubsegment_h

#undef DSLSubsegment_RECURSES
#endif // else defined(DSLSubsegment_RECURSES)