GU/GU_PrimRBezCurve.h

Go to the documentation of this file.

/*
 * PROPRIETARY INFORMATION.  This software is proprietary to
 * Side Effects Software Inc., and is not to be reproduced,
 * transmitted, or disclosed in any way without written permission.
 *
 * Produced by:
 *      Cristin Barghiel
 *      Side Effects Software Inc.
 *      20 Maud St.
 *      Toronto, Ontario,  M5V 2M5
 *      Canada
 *      416-366-4607
 *
 * NAME:        GU_PrimRBezCurve.h (C++)
 *
 * COMMENTS:
 *      Header file for GU_PrimRBezCurve.h class...
 * 
 */

#ifndef __GU_PrimRBezCurve_h__
#define __GU_PrimRBezCurve_h__

#include "GU_API.h"
#include <GEO/GEO_PrimRBezCurve.h>
#include <GEO/GEO_PrimNURBCurve.h>
#include "GU_Curve.h"

class GU_Detail;
class GU_PrimPoly;
class UT_Vector4Array;

/////////////////////////////////////////////////////////////
//                                                         //
// Class:     GU_PrimRBezCurve                             //
// Descr:     This class is responsible for operations     //
//       done on bezier primitives.  As we need to access  //
//       the GU_Detail, the pointer is passed in the       //
//       constructor.  The second constructor creates a    //
//       mesh with the given parameters.                   //
//                                                         //
/////////////////////////////////////////////////////////////

class GU_API GU_PrimRBezCurve : public GEO_PrimRBezCurve, public GU_Curve
{
public:
    // This constructor creates a new GU_PrimRBezCurve but does
    // not append it to the detail
     GU_PrimRBezCurve(GU_Detail *gdp) : GEO_PrimRBezCurve((GEO_Detail *)gdp), 
                                      GU_Curve() 
     {
         setCurve(this); // just so that GU_Curve can talk to us.
     }

#if 0
    // This constructor creates a new GU_PrimRBezCurve and 
    // appends it to the detail.  
     GU_PrimRBezCurve(GU_Detail *gdp, int nelems, int order = 4, int closed = 0,
                                      int appendPoints = 1);
#endif
    ~GU_PrimRBezCurve();

     GU_PrimPoly        *makeGrevillePoly(GU_Detail *dest = 0);

    virtual void                *castTo() const;
    virtual const GEO_Primitive *castToGeo(void) const;

    // NOTE:  For static member functions please call in the following
    //        manner.  <ptrvalue> = GU_PrimRBezCurve::<functname>
    //        i.e.        meshptr = GU_PrimRBezCurve::build(params...);

    // Optional Build Method. Returns 0 if it fails. 

     static GU_PrimRBezCurve    *build(GU_Detail *gudp, 
                                       int nelems, int order = 4, int closed=0,
                                       int appendPoints = 1);

    virtual int         intersectRay(const UT_Vector3 &o, const UT_Vector3 &d,
                                float tmax = 1E17F, float tol = 1E-12F,
                                float *distance = 0, UT_Vector3 *pos = 0,
                                UT_Vector3 *nml = 0, int accurate = 0,
                                float *u = 0, float *v = 0,
                                int ignoretrim = 1) const;

    GEO_Primitive       *convertNew(GU_ConvertParms &parms);
    GEO_PrimNURBCurve   *convertToNURBNew(void);


    // This is more powerful than convertNew. It always returns a NEW
    // object, so free it when you're done with it. It may return
    // a NURB curve or a Bezier curve depending on the type.
    virtual GEO_Face    *reconfigure(unsigned type, int order, int open, 
                                     int interpends, int nonrational) const;

    // Cut a wedge of the primitive given a domain range
    // ind1 and ind2 are indices to the refined values
    // They are updated if negative on input, else used as is.
    // If keep is zero the curve is only refined and the indices
    // updated.

    virtual GU_Curve    *cut(float u1, float u2, 
                             int &ind1, int &ind2, int keep);

    // Open the primitive at the given domain value
    virtual void         openAt(float u);


    // Given a bit array representing the edges in the curve (1 meaning
    // delete and 0 meaning keep) delete as many edges as possible
    // if a particular edge cannot be deleted then negate the value
    // in removededges[edgenum] DO NOT CHANGE THE MAGNITUDE!
    // returns 0 if successful, -1 if the curve becomes degenerate, and
    // -2 if the curve should be removed.
    int                  removeEdges(const UT_BitArray &edgemap,
                                     UT_IntArray &removededges);

    // Methods for fitting.
    void                 interpLocal(const UT_PtrArray<GEO_Point *> &gpData,
                                     int order, int wrapped, int corner);
    void                 interpLocal(const UT_Vector4Array &v4Data,
                                     int order, int wrapped, int corner);

private:

     // Fill the curve with data and build the basis. Return 0 if OK, and -1
     // if error.
     int                create(int nelems, int order = 4, int closed = 0,
                                           int appendPoints = 1);

};

#endif

---