---

IgBSPTree Class Reference

#include <Iguana/Inventor/interface/IgBSPTree.h>

List of all members.

Public Types
enum	{ COPLANAR_IN_FRONT, COPLANAR_IN_BACK, COPLANAR_IN_NODE }
Public Member Functions
void	add (SoNode *node)
void	addOnlyOneFace (SoNode *node)
bool	empty (void)
	Returns: true if the BSP-Tree is empty.
int	getTriangleCount (void)
	IgBSPTree (void)
void	intersect (SoNode *node, IgBSPTriangle::List *frontTriangles, IgBSPTriangle::List *backTriangles)
void	intersect (IgBSPTriangle *triangle, IgBSPTriangle::List *frontTriangles, IgBSPTriangle::List *backTriangles)
	~IgBSPTree (void)
Private Attributes
IgBSPNode *	m_rootNode

---

Detailed Description

Definition at line 20 of file IgBSPTree.h.

---

Member Enumeration Documentation

anonymous enum

Enumerator:

COPLANAR_IN_FRONT
COPLANAR_IN_BACK
COPLANAR_IN_NODE

Definition at line 23 of file IgBSPTree.h.

    {
        COPLANAR_IN_FRONT,
        COPLANAR_IN_BACK,
        COPLANAR_IN_NODE
    };

---

Constructor & Destructor Documentation

IgBSPTree::IgBSPTree

(

void

)

Definition at line 54 of file IgBSPTree.cc.

    :m_rootNode (0)
{
}

IgBSPTree::~IgBSPTree

(

void

)

Definition at line 59 of file IgBSPTree.cc.

References m_rootNode.

{
    if (m_rootNode)
        delete m_rootNode;
}

---

Member Function Documentation

void IgBSPTree::add

(

SoNode *

node

)

Definition at line 299 of file IgBSPTree.cc.

References cmsRelvalreport::action, addBestPlane(), m_rootNode, nodeToList(), and IgBSPTriangle::unrefAndDeleteTriangles().

Referenced by IgSurfaceOperation::apply().

{
    IgBSPTriangle::List triangleList;
    
    SoCallbackAction action;
    action.addTriangleCallback (SoNode::getClassTypeId (), 
                                nodeToList, 
                                (void *) &triangleList);
    action.apply (node);    
    
    // Add the best splitting planes for this set of triangles.
    //    addBestPlane (m_rootNode, triangleList);

    //    if (triangleList.begin () != triangleList.end ())
    // {
    //  if (m_rootNode == 0)
    //  {
    //      m_rootNode = new IgBSPNode ((*triangleList.begin ()));
    //  }
    //  m_rootNode->add (triangleList);    
    //}
    
    addBestPlane (m_rootNode, triangleList);
    IgBSPTriangle::unrefAndDeleteTriangles (triangleList);
}

void IgBSPTree::addOnlyOneFace

(

SoNode *

node

)

Definition at line 66 of file IgBSPTree.cc.

Referenced by IgSurfaceOperation::apply().

{
    //    SoCallbackAction action;
    //action.addTriangleCallback (SoNode::getClassTypeId (), 
    //                          faceToBSP,
    //                          (void *) &m_rootNode);
    //    action.apply (node);
    //std::cerr << "Number of triangles in the BSP tree: " 
    // << getTriangleCount () << std::endl;    
}

bool IgBSPTree::empty

(

void

)

Returns:

true if the BSP-Tree is empty.

Definition at line 378 of file IgBSPTree.cc.

References m_rootNode.

Referenced by intersect().

{ return m_rootNode == 0; }

int IgBSPTree::getTriangleCount

(

void

)

Definition at line 371 of file IgBSPTree.cc.

{
    //return m_rootNode ? m_rootNode->getTriangleCount () : -1;    
    return 0;    
}

void IgBSPTree::intersect	(	SoNode *	node,
		IgBSPTriangle::List *	frontTriangles,
		IgBSPTriangle::List *	backTriangles
	)

Definition at line 347 of file IgBSPTree.cc.

References cmsRelvalreport::action, end, i, intersect(), nodeToList(), and IgBSPTriangle::unrefAndDeleteTriangles().

{
    IgBSPTriangle::List triangleList;
    
    SoCallbackAction action;
    action.addTriangleCallback (SoNode::getClassTypeId (), 
                                nodeToList, 
                                (void *) &triangleList);
    action.apply (node);

    IgBSPTriangle::List::iterator end (triangleList.end ());
    
    for (IgBSPTriangle::List::iterator i = triangleList.begin ();
         i != end;
         i++)
    {
        intersect ((*i), frontTriangles, backTriangles);        
    }
    IgBSPTriangle::unrefAndDeleteTriangles (triangleList);  
}

void IgBSPTree::intersect	(	IgBSPTriangle *	triangle,
		IgBSPTriangle::List *	frontTriangles,
		IgBSPTriangle::List *	backTriangles
	)

Definition at line 326 of file IgBSPTree.cc.

References IgBSPNode::add(), empty(), and m_rootNode.

Referenced by IgSurfaceOperation::apply(), and intersect().

{
    if (!empty ())
    {
        // WARNING: add takes ownerwhip of triangle, so such a pointer
        // could be not valid anymore after this call.
        m_rootNode->add (triangle, 
                         false, 
                         frontTriangles, 
                         backTriangles);    
    }
    else 
    {
        //      std::cerr << "IgBSPTree::intersect : doing intersection against empty tree!" 
        //        << std::endl; 
    }
}

---

Member Data Documentation

IgBSPNode* IgBSPTree::m_rootNode [private]

Definition at line 49 of file IgBSPTree.h.

Referenced by add(), empty(), intersect(), and ~IgBSPTree().

---

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

• Iguana/Inventor/interface/IgBSPTree.h
• Iguana/Inventor/src/IgBSPTree.cc

---