BOP_BSPTree.cpp

Go to the documentation of this file.

/*
 * ***** BEGIN GPL LICENSE BLOCK *****
 *
 * 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; either version 2
 * of the License, or (at your option) any later version.
 *
 * 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
 *
 * The Original Code is Copyright (C) 2001-2002 by NaN Holding BV.
 * All rights reserved.
 *
 * The Original Code is: all of this file.
 *
 * Contributor(s): none yet.
 *
 * ***** END GPL LICENSE BLOCK *****
 */

#include "BOP_BSPTree.h"
#include <vector>
#include <iostream>

BOP_BSPTree::BOP_BSPTree()
{
    m_root = NULL;
    m_bspBB = NULL;
}

BOP_BSPTree::~BOP_BSPTree()
{
    if (m_root!=NULL) delete m_root;
    if (m_bspBB!=NULL) delete m_bspBB;
}

void BOP_BSPTree::addMesh(BOP_Mesh* mesh, BOP_Faces& facesList)
{
    for (BOP_IT_Faces it = facesList.begin(); it != facesList.end(); ++it) {
        addFace( mesh, *it );
    }
    
}

void BOP_BSPTree::addFace(BOP_Mesh* mesh, BOP_Face* face)
{
    addFace(mesh->getVertex(face->getVertex(0))->getPoint(),
            mesh->getVertex(face->getVertex(1))->getPoint(),
            mesh->getVertex(face->getVertex(2))->getPoint(),
            face->getPlane());
}

void BOP_BSPTree::addFace(const MT_Point3& p1, 
                          const MT_Point3& p2, 
                          const MT_Point3& p3, 
                          const MT_Plane3& plane)
{
    if (m_root == NULL)
        m_root = new BOP_BSPNode(plane);
    else {
        BOP_BSPPoints pts;

        pts.push_back(p1);
        pts.push_back(p2);
        pts.push_back(p3);

        m_root->addFace(pts,plane);
    }

    // update bounding box
    m_bbox.add(p1);
    m_bbox.add(p2);
    m_bbox.add(p3);
}

BOP_TAG BOP_BSPTree::classifyFace(const MT_Point3& p1, 
                                  const MT_Point3& p2, 
                                  const MT_Point3& p3, 
                                  const MT_Plane3& plane) const
{
    if ( m_root != NULL )
      return m_root->classifyFace(p1, p2, p3, plane);
    else
      return OUT;
}

BOP_TAG BOP_BSPTree::filterFace(const MT_Point3& p1, 
                                const MT_Point3& p2, 
                                const MT_Point3& p3, 
                                BOP_Face* face)
{
    if ( m_bspBB != NULL ) {
        return m_bspBB->classifyFace(p1,p2,p3,face->getPlane());
    }
    else
        return UNCLASSIFIED;
}

BOP_TAG BOP_BSPTree::simplifiedClassifyFace(const MT_Point3& p1, 
                                            const MT_Point3& p2, 
                                            const MT_Point3& p3, 
                                            const MT_Plane3& plane) const
{
    if ( m_root != NULL )
      return m_root->simplifiedClassifyFace(p1, p2, p3, plane);
    else
      return OUT;
}

unsigned int BOP_BSPTree::getDeep() const
{
    if ( m_root != NULL )
      return m_root->getDeep();
    else
      return 0;
}

void BOP_BSPTree::print()
{
    if ( m_root != NULL )
        m_root->print( 0 );
}