BSP_MeshPrimitives.h

Go to the documentation of this file.

/*
 * $Id: BSP_MeshPrimitives.h 35145 2011-02-25 10:44:20Z jesterking $
 * ***** 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 *****
 */

#ifndef NAN_INCLUDED_BSP_MeshPrimitives
#define NAN_INCLUDED_BSP_MeshPrimitives

#include "CTR_TaggedIndex.h"
#include "MT_Vector3.h"
#include "MT_Plane3.h"

#include <vector>

typedef CTR_TaggedIndex<24,0x00ffffff> BSP_VertexInd;
typedef CTR_TaggedIndex<24,0x00ffffff> BSP_EdgeInd;
typedef CTR_TaggedIndex<24,0x00ffffff> BSP_FaceInd;
typedef CTR_TaggedIndex<24,0x00ffffff> BSP_FragInd;


typedef std::vector<BSP_VertexInd> BSP_VertexList;
typedef std::vector<BSP_EdgeInd> BSP_EdgeList;
typedef std::vector<BSP_FaceInd> BSP_FaceList;

enum BSP_Classification{
        e_unclassified = 0,
        e_classified_in = 1,
        e_classified_out = 2,
        e_classified_on = 4,
        e_classified_spanning = 7
};

class BSP_MVertex {
public :
        MT_Point3 m_pos;
        BSP_EdgeList m_edges;
        
        bool m_select_tag;
        int m_open_tag;

        BSP_MVertex(
        );

        BSP_MVertex(
                const MT_Point3 & pos
        );

                BSP_MVertex &
        operator = (
                const BSP_MVertex & other
        ) {
                m_pos = other.m_pos;
                m_edges = other.m_edges;
                m_select_tag = other.m_select_tag;
                m_open_tag = other.m_open_tag;
                return (*this);
        };

                bool
        RemoveEdge(
                BSP_EdgeInd e
        );      

                void
        AddEdge(
                BSP_EdgeInd e
        );

                void
        SwapEdge(
                BSP_EdgeInd e_old,
                BSP_EdgeInd e_new
        );

                int
        OpenTag(
        ) const;

                void
        SetOpenTag(
                int tag
        );
                
                bool
        SelectTag(
        ) const;

                void
        SetSelectTag(
                bool tag        
        );
};

class BSP_MEdge {
public :
        BSP_VertexInd m_verts[2];
        BSP_FaceList m_faces;

        BSP_MEdge(
        );

        bool operator == (
                BSP_MEdge & rhs
        );

                void
        SwapFace(
                BSP_FaceInd old_f,
                BSP_FaceInd new_f
        );

        BSP_VertexInd
        OpVertex(
                BSP_VertexInd vi
        ) const;

                bool
        SelectTag(
        ) const;

                void
        SetSelectTag(
                bool tag        
        );
        
                int
        OpenTag(
        ) const;

                void
        SetOpenTag(
                int tag
        ) ;
};

class BSP_MFace {
public :

        BSP_VertexList m_verts;

        // We also store the plane equation of this
        // face. Generating on the fly during tree
        // construction can lead to a lot of numerical errors.
        // because the polygon size can get very small.

        MT_Plane3 m_plane;

        int m_open_tag;
        unsigned int m_orig_face;

        BSP_MFace(
        );

        // Invert the face , done by reversing the vertex order 
        // and inverting the face normal.

                void
        Invert(
        );

                bool
        SelectTag(
        ) const;

                void
        SetSelectTag(
                bool tag        
        );      

                int
        OpenTag(
        ) const;

                void
        SetOpenTag(
                int tag
        ) ;

};

#endif