GeometryIntersection< nDim_ >::CsgNode Class Reference

Collaboration diagram for GeometryIntersection< nDim_ >::CsgNode:

Public Member Functions
	CsgNode (std::vector< CsgPolygon > _polygons)
	CsgNode ()
	~CsgNode ()
void	invert ()
std::vector< CsgPolygon >	clipPolygons (std::vector< CsgPolygon > _polygons)
void	clipTo (CsgNode &bsp)
std::vector< CsgPolygon >	allPolygons ()
template<class T = void>
std::enable_if< nDim_==2, T >::type	build (std::vector< CsgPolygon > _polygons)
template<class T = void>
std::enable_if< nDim_==3, T >::type	build (std::vector< CsgPolygon > _polygons)

Public Attributes
CsgPlane	plane
MBool	planeValid
CsgNode *	front
CsgNode *	back
std::vector< CsgPolygon >	polygons

Detailed Description

template<MInt nDim_>
class GeometryIntersection< nDim_ >::CsgNode

Definition at line 740 of file geometryintersection.h.

Constructor & Destructor Documentation

CsgNode() [1/2]

template<MInt nDim_>

GeometryIntersection< nDim_ >::CsgNode::CsgNode ( std::vector< CsgPolygon >  _polygons )

inlineexplicit

Definition at line 748 of file geometryintersection.h.

                                                      {
      planeValid = false;
      front = nullptr;
      back = nullptr;
      polygons.clear();
      this->build(_polygons);
    }

CsgNode() [2/2]

template<MInt nDim_>

GeometryIntersection< nDim_ >::CsgNode::CsgNode ( )

inline

Definition at line 756 of file geometryintersection.h.

              {
      planeValid = false;
      front = nullptr;
      back = nullptr;
      polygons.clear();
    }

~CsgNode()

template<MInt nDim_>

GeometryIntersection< nDim_ >::CsgNode::~CsgNode ( )

inline

Definition at line 763 of file geometryintersection.h.

               {
      this->polygons.clear();
      delete this->front;
      delete this->back;
    }

Member Function Documentation

allPolygons()

template<MInt nDim_>

std::vector< CsgPolygon > GeometryIntersection< nDim_ >::CsgNode::allPolygons ( )

inline

Definition at line 806 of file geometryintersection.h.

                                        {
      std::vector<CsgPolygon> _polygons(this->polygons);
      if(this->front) {
        std::vector<CsgPolygon> _polygons_front = this->front->allPolygons();
        for(MInt i = 0; (unsigned)i < _polygons_front.size(); i++)
          _polygons.push_back(_polygons_front[i]);
      }
      if(this->back) {
        std::vector<CsgPolygon> _polygons_back = this->back->allPolygons();
        for(MInt i = 0; (unsigned)i < _polygons_back.size(); i++)
          _polygons.push_back(_polygons_back[i]);
      }
      return _polygons;
    }

build() [1/2]

template<MInt nDim_>

template<class T = void>

std::enable_if< nDim_==2, T >::type GeometryIntersection< nDim_ >::CsgNode::build ( std::vector< CsgPolygon >  _polygons )

inline

Definition at line 824 of file geometryintersection.h.

                                                                                    {
      if(_polygons.empty()) return;
      if(!planeValid) {
        this->plane = _polygons[0].plane.clone();
        planeValid = true;
      }
      std::vector<CsgPolygon> _front;
      std::vector<CsgPolygon> _back;
      this->plane.insertCoplanarPolygon(&_polygons[0], &this->polygons, &this->polygons);
      for(MInt i = 1; (unsigned)i < _polygons.size(); i++) {
        this->plane.splitPolygon(&_polygons[i], &this->polygons, &this->polygons, &_front, &_back);
      }
      if(!_front.empty()) {
        if(!this->front) this->front = new CsgNode();
        this->front->build(_front);
      }
      if(!_back.empty()) {
        if(!this->back) this->back = new CsgNode();
        this->back->build(_back);
      }
    }

build() [2/2]

template<MInt nDim_>

template<class T = void>

std::enable_if< nDim_==3, T >::type GeometryIntersection< nDim_ >::CsgNode::build ( std::vector< CsgPolygon >  _polygons )

inline

Definition at line 846 of file geometryintersection.h.

                                                                                    {
      if(_polygons.empty()) return;
      std::vector<CsgPolygon> _front;
      std::vector<CsgPolygon> _back;
      MInt polygonStartIndex = 0;
      if(!planeValid) {
        this->plane = _polygons[0].plane.clone();
        planeValid = true;
        this->polygons.push_back(_polygons[0]);
        polygonStartIndex = 1;
      }
      for(MInt i = polygonStartIndex; (unsigned)i < _polygons.size(); i++) {
        this->plane.splitPolygon(&_polygons[i], &this->polygons, &this->polygons, &_front, &_back);
      }
      if(!_front.empty()) {
        if(!this->front) this->front = new CsgNode();
        this->front->build(_front);
      }
      if(!_back.empty()) {
        if(!this->back) this->back = new CsgNode();
        this->back->build(_back);
      }
    }

clipPolygons()

template<MInt nDim_>

std::vector< CsgPolygon > GeometryIntersection< nDim_ >::CsgNode::clipPolygons ( std::vector< CsgPolygon >  _polygons )

inline

Definition at line 781 of file geometryintersection.h.

                                                                        {
      if(!planeValid) {
        return _polygons;
      }
      std::vector<CsgPolygon> _front;
      std::vector<CsgPolygon> _back;
      for(MInt i = 0; (unsigned)i < _polygons.size(); i++) {
        this->plane.splitPolygon(&_polygons[i], &_front, &_back, &_front, &_back);
      }
      if(this->front) _front = this->front->clipPolygons(_front);
      if(this->back)
        _back = this->back->clipPolygons(_back);
      else
        _back.clear();
      for(MInt i = 0; (unsigned)i < _back.size(); i++)
        _front.push_back(_back[i]);
      return _front;
    }

clipTo()

template<MInt nDim_>

void GeometryIntersection< nDim_ >::CsgNode::clipTo ( CsgNode &  bsp )

inline

Definition at line 800 of file geometryintersection.h.

                              {
      this->polygons = bsp.clipPolygons(this->polygons);
      if(this->front) this->front->clipTo(bsp);
      if(this->back) this->back->clipTo(bsp);
    }

invert()

template<MInt nDim_>

void GeometryIntersection< nDim_ >::CsgNode::invert ( )

inline

Definition at line 769 of file geometryintersection.h.

                  {
      for(MInt i = 0; (unsigned)i < this->polygons.size(); i++) {
        this->polygons[i].flip();
      }
      this->plane.flip();
      if(this->front) this->front->invert();
      if(this->back) this->back->invert();
      CsgNode* temp = this->front;
      this->front = this->back;
      this->back = temp;
    }

Member Data Documentation

back

template<MInt nDim_>

CsgNode* GeometryIntersection< nDim_ >::CsgNode::back

Definition at line 745 of file geometryintersection.h.

front

template<MInt nDim_>

CsgNode* GeometryIntersection< nDim_ >::CsgNode::front

Definition at line 744 of file geometryintersection.h.

plane

template<MInt nDim_>

CsgPlane GeometryIntersection< nDim_ >::CsgNode::plane

Definition at line 742 of file geometryintersection.h.

planeValid

template<MInt nDim_>

MBool GeometryIntersection< nDim_ >::CsgNode::planeValid

Definition at line 743 of file geometryintersection.h.

polygons

template<MInt nDim_>

std::vector<CsgPolygon> GeometryIntersection< nDim_ >::CsgNode::polygons

Definition at line 746 of file geometryintersection.h.

---

The documentation for this class was generated from the following file:

• /home/gitlab-runner/scratch/builds/oxpnswJ6/1/aia/m-AIA/m-AIA/src/GEOM/geometryintersection.h