SG_Tree.h

Go to the documentation of this file.

/*
 * $Id: SG_Tree.h 35082 2011-02-22 19:30:37Z 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 __SG_TREE_H__
#define __SG_TREE_H__
 
#include "MT_Point3.h"
#include "SG_BBox.h"

#include <set> 

class SG_Node;


class SG_Tree 
{
        SG_Tree* m_left;
        SG_Tree* m_right;
        SG_Tree* m_parent;
        SG_BBox  m_bbox;
        MT_Point3 m_center;
        MT_Scalar m_radius;
        SG_Node* m_client_object;
public:
        SG_Tree();
        SG_Tree(SG_Tree* left, SG_Tree* right);
        
        SG_Tree(SG_Node* client);
        ~SG_Tree();
        
        MT_Scalar volume() const;
        
        void dump() const;
        
        SG_Tree *Left() const;
        SG_Tree *Right() const;
        SG_Node *Client() const;
        
        SG_Tree* Find(SG_Node *node);
        void get(MT_Point3 *box) const;
        const SG_BBox& BBox() const;
        
        bool inside(const MT_Point3 &point) const;
        
        void SetLeft(SG_Tree *left);
        void SetRight(SG_Tree *right);

        MT_Point3 Center() const { return m_center; }
        MT_Scalar Radius() { return m_radius; }
        
        //friend class SG_TreeFactory;
        
        struct greater
        {
                bool operator()(const SG_Tree *a, const SG_Tree *b)
                {
                        return a->volume() > b->volume();
                }
        };
        
        
        
#ifdef WITH_CXX_GUARDEDALLOC
public:
        void *operator new(size_t num_bytes) { return MEM_mallocN(num_bytes, "GE:SG_Tree"); }
        void operator delete( void *mem ) { MEM_freeN(mem); }
#endif
};


class SG_TreeFactory 
{
        typedef std::multiset<SG_Tree*, SG_Tree::greater> TreeSet;
        TreeSet m_objects;
public:
        SG_TreeFactory();
        ~SG_TreeFactory();
        
        void Add(SG_Node* client);
        void Add(SG_Tree* tree);

        SG_Tree* MakeTreeUp();
        
        SG_Tree* MakeTreeDown(SG_BBox &bbox);
        
        SG_Tree* MakeTree();
        
        
#ifdef WITH_CXX_GUARDEDALLOC
public:
        void *operator new(size_t num_bytes) { return MEM_mallocN(num_bytes, "GE:SG_TreeFactory"); }
        void operator delete( void *mem ) { MEM_freeN(mem); }
#endif
};

#endif /* __SG_BBOX_H__ */