CurveBoundedDomain.h

//===========================================================================
// GoTools - SINTEF Geometry Tools version 1.1
//
// GoTools module: CORE
//
// Copyright (C) 2000-2007 SINTEF ICT, Applied Mathematics, Norway.
//
// This program 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 version 2 of the License. 
//
// This program 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 this program; if not, write to the Free Software            
// Foundation, Inc.,                                                      
// 59 Temple Place - Suite 330,                                           
// Boston, MA  02111-1307, USA.                                           
//
// Contact information: E-mail: tor.dokken@sintef.no                      
// SINTEF ICT, Department of Applied Mathematics,                         
// P.O. Box 124 Blindern,                                                 
// 0314 Oslo, Norway.                                                     
//
// Other licenses are also available for this software, notably licenses
// for:
// - Building commercial software.                                        
// - Building software whose source code you wish to keep private.        
//===========================================================================
#ifndef _GOCURVEBOUNDEDDOMAIN_H
#define _GOCURVEBOUNDEDDOMAIN_H

#include "Domain.h"
#include "RectDomain.h"
#include "CurveLoop.h"
#include "SplineSurface.h"
#include "CurveOnSurface.h"

using std::vector;
using std::pair;
using boost::shared_ptr;

namespace Go
{


class CurveBoundedDomain : public Domain
{
public:
    CurveBoundedDomain()
    {}



    CurveBoundedDomain(vector<shared_ptr<CurveLoop> > loops);

    CurveBoundedDomain(shared_ptr<CurveLoop> ccw_loop);

    virtual ~CurveBoundedDomain();

    // virtual DomainType domainType() const;
    // @@ Seems that direction of bd cv is not used. Fine by me.

    virtual bool isInDomain(const Array<double, 2>& point, 
                            double tolerance) const;

    virtual bool isOnBoundary(const Array<double, 2>& point, 
                              double tolerance) const;

    virtual void closestInDomain(const Array<double, 2>& point,
                                 Array<double, 2>& clo_pt,
                                 double tolerance) const;

    virtual void closestOnBoundary(const Array<double, 2>& point,
                                   Array<double, 2>& clo_bd_pt,
                                   double tolerance) const;

    RectDomain containingDomain() const;

    void clipWithDomain(int pardir, double parval, 
                        double tolerance, shared_ptr<SplineSurface> srf,
                        vector<shared_ptr<CurveOnSurface> >& trim_pieces) const;

    // Determine which intervals of a 2D spline curve lies inside the bounded
    // domain.  The start and end parameter values for the inside intervals are
    // found in the vector 'params_start_end_interval'.  Even entries in this 
    // vector marks the start of an inside interval, odd entries marks the end.


    void findPcurveInsideSegments(const SplineCurve& curve,
                                  double tolerance,
                                  vector<double>& params_start_end_interval) const;

private:
    typedef struct intersection_point {
        double par1, par2;
        int pretop;
        
        intersection_point(double p1, double p2, int top)
        { par1 = p1; par2 = p2; pretop = top;}
        
    } intersection_point;
    
    // Comparisement function to use in std::sort
    static bool par1_compare(const intersection_point& el1,
                             const intersection_point& el2)
    {
        if (el1.par1 < el2.par1)
            return true;
        else
            return false;
    }
    

    // We store a set of curve loops
    vector<shared_ptr<CurveLoop> > loops_;

    // Fetch all intervals in one parameter direction
    // going through a specific point lying inside the 
    // bounded domain.
    void getInsideIntervals(int pardir, double parval, double tolerance,
                            vector<pair<double, double> >& insideInts) const;

    // We return a pointer to a parameter curve defining boundary. If loops_
    // consists of CoCurveOnSurface's, the parameter domain curve is returned.
    // Otherwise we make sure that dimension really is 2.
    shared_ptr<ParamCurve> getParameterCurve(int loop_nmb, int curve_nmb) const;

    // Determine which intervals of a 2D spline curve lies inside the bounded 
    // domain.  The start and end parameter values for the inside intervals are 
    // found in the intersection_points in the 'intpt' vector.  Those
    // intersection_points with even indexes marks the start of such an interval,
    // each following (odd-indexed) intersection_point mark the end of that interval.
    void findPcurveInsideSegments(const SplineCurve& curve,
                                  double tolerance, 
                                  vector<intersection_point>& intpt) const;

};


} // namespace Go

#endif // _GOCURVEBOUNDEDDOMAIN_H

---