Par2FuncIntersector.h

//===========================================================================
// GoTools - SINTEF Geometry Tools
//
// GoTools module: Intersections, version 1.0
//
// 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 _PAR2FUNCINTERSECTOR_H
#define _PAR2FUNCINTERSECTOR_H


#include "IntersectorFuncConst.h"
#include "IntersectionPoint.h"


namespace Go {




class Par2FuncIntersector : public IntersectorFuncConst {
public:

//     Par2FuncIntersector(boost::shared_ptr<ParamFunctionInt> func,
//                      boost::shared_ptr<ParamFunctionInt> C,
//                      double epsge,
//                      Intersector* prev = 0);

    Par2FuncIntersector(boost::shared_ptr<ParamFunctionInt> func,
                        boost::shared_ptr<ParamFunctionInt> C,
                        boost::shared_ptr<GeoTol> epsge,
                        Intersector *prev = 0,
                        int eliminated_parameter = -1,
                        double eliminated_value = 0);

    virtual ~Par2FuncIntersector();

//     // Validation of given intersection results
//     virtual void validate(int level, ValidationStat status);

    virtual int numParams() const
    { return 2; }
        
protected:
    // Data members

    virtual boost::shared_ptr<Intersector> 
    lowerOrderIntersector(boost::shared_ptr<ParamFunctionInt> obj1,
                          boost::shared_ptr<ParamFunctionInt> obj2,
                          Intersector* prev = 0,
                          int eliminated_parameter = -1,
                          double eliminated_value = 0);

    virtual int checkCoincidence();

    virtual void microCase();
    
    virtual int updateIntersections();

    virtual int repairIntersections()
    { return 0; }

    bool
    isConnected(std::vector<boost::shared_ptr<IntersectionPoint> > bd_ints,
                int nmbbd);

    bool isConnected(std::vector<std::
                     pair<boost::shared_ptr<IntersectionPoint>,
                     IntPtClassification> >& bd_ints, 
                     int nmb_nottouch);

    bool connectDirected(std::vector<std::
                         pair<boost::shared_ptr<IntersectionPoint>,
                         IntPtClassification> >& bd_ints,
                         int nmbbd);

    bool canConnect(boost::shared_ptr<IntersectionPoint> pt1,
                    boost::shared_ptr<IntersectionPoint> pt2);

    virtual int doSubdivide();

private:

    int getSubdivisionParameter(int dir, double& par);

    // We need to decide in which direction to subdivide.
    int sortParameterDirections(int perm[]); //, int deg_edge[]);

    int checkSubdivParam(int dir, double par, double ta, double tb,
                         std::vector<boost::
                         shared_ptr<IntersectionPoint> >& int_pts);

    int checkIsoCurve(int pdir, bool first, double par,
                      std::vector<boost::
                      shared_ptr<IntersectionPoint> > int_pts);

    bool getSubdivAtSing(int dir, double ta, double tb, double& par);

//     void splitIntResults(std::vector<boost::
//                       shared_ptr<IntersectionPoint> >& int_pts,
//                       int pardir, double par,
//                       double start, double end);

//     void doIterate(int pardir, double parval, double param[], double& dist,
//                 double seed[]);

//     // Utility function for sorting input bd_int's.
//     IntPtClassification bdDir(const IntersectionPoint& int_pt,
//                            Point sorting_dir);

    void writeDebugConnect(std::vector<std::
                           pair<boost::shared_ptr<IntersectionPoint>,
                           IntPtClassification> >& bd_ints);

};


} // namespace Go


#endif // _PAR2FUNCINTERSECTOR_H

---