TL2Triangles.h

#ifndef _mgTL2Triangles_HH_
#define _mgTL2Triangles_HH_

#include "mg/Pvector.h"
#include "Tl2/TL2Triangle.h"

/****************************************************************/
/*   Copyright (c) 2015 by DG Technologies, Inc.                */
/*                       All rights reserved.                   */
/****************************************************************/

class MGFace;
class mgTL2Face;
class mgTL2Fans;
class mgTL2LPline;


class MG_DLL_DECLR mgTL2Triangles{

public:
    typedef MGPvector<mgTL2Triangle>::const_iterator const_iterator;
    typedef MGPvector<mgTL2Triangle>::iterator iterator;

friend std::ostream& operator<< (std::ostream& out, const mgTL2Triangles& tlTriangles);


mgTL2Triangles(
    MGCL::TL_DATA_KIND dkind=MGCL::UV,
    const MGSurface* surf=0
);

mgTL2Triangles(const mgTL2Triangles& tris);


const mgTL2Triangle& operator[](int i)const;
mgTL2Triangle& operator[](int i);

iterator begin(){return m_triangles.begin();}
iterator end(){return m_triangles.end();}
const_iterator begin()const{return m_triangles.begin();}
const_iterator end()const{return m_triangles.end();}

mgTL2Triangle* front(){return m_triangles.front();};
mgTL2Triangle* back(){return m_triangles.back();};

const mgTL2Triangle* front()const{return m_triangles.front();};
const mgTL2Triangle* back()const{return m_triangles.back();};

bool is_uv()const{return m_kind==MGCL::UV;};

void makeStrip(
    const mgTL2LPline& pline0,
    const mgTL2LPline& pline2
);

void makeFan(
    const mgTL2LPline& plinen,
    const mgTL2LPline& pline0
);

bool need_normal()const{return m_kind==MGCL::XYZNormal;};

MGCL::TL_DATA_KIND get_kind()const{return m_kind;};

void push_back(mgTL2Triangle* pTlTriangle){m_triangles.push_back(pTlTriangle);};
void push_back(mgTL2Triangles& tris){m_triangles.push_back(tris.m_triangles);};

void push_back(
    const mgTL2Fans& fans,
    int nvTri,
    const std::vector<int>& verticesIDs
);

int size()const{return int(m_triangles.size());};

void set_surface(const MGSurface* surf){m_surface=surf;};
const MGSurface* surface()const{return m_surface;};

void tessellate1234edgesLoop(
    const MGLoop& oloop//Outer boundary loop of the face of mgTL2Plygon
                    //to tessellate whose number of edges is 4.
);

private:
    const MGSurface* m_surface;
    MGCL::TL_DATA_KIND m_kind;

    MGPvector<mgTL2Triangle> m_triangles;   

    
void tessellate2by2(
    const mgTL2LPline&  pl,
    const mgTL2LPline&  pl_opposite
);

void tessellate222n(
    const mgTL2LPline& pl_id3,//edge that has 3 or more than 3 vetices.
    const mgTL2LPline& pl_opposite//opposite edge of pl_id3.
);

void tessellate2n2n(
    const mgTL2LPline& pl,//an edge whose number of vetices is more than 2.
    const mgTL2LPline& pl_opposite//Opposite edge of pl.
);

void tessellate22nn(
    int id2,    //id of edge that has 2 vertices. Next edge of id2 also have only 2 vertices.
    const mgTL2LPline pline[4]
);

void tessellate2(
    const mgTL2LPline LPline[2]
);

void tessellate3nnn(
    int id3,    //id of edge that has 2 or 3 vertices.
    const mgTL2LPline pline[4]
);

void tessellate3(
    const mgTL2LPline LPline[3]
);

//Tessellate a rectangle of a General case.
//All of the four edges have 4 or more than 4 vertices.
//Tessellated triangles will be appended.
void tessellate_nnnn(
    int minID,
    const mgTL2LPline pline[4]
);

void tessellate_nm(
    int maxID,
    const mgTL2LPline pline[4]
);
void tessellate4(
    const mgTL2LPline LPline[4]
);

void tessellateConcave4(
    int concaveID,  //vertiex id at which vertex concavity is detected.
    const mgTL2LPline LPline[4]
);

void tessellateSharp4(
    int sharpID,    //vertiex id at which sharpness is detected.
    const mgTL2LPline LPline[4]
);

};
 // end of UseTessellation group
#endif