forked from bartvdbraak/blender
51b4145841
This commit contains a number of performance improvements for the BGE in the Scenegraph (parent relation between objects in the scene) and view frustrum culling. The scenegraph improvement consists in avoiding position update if the object has not moved since last update and the removal of redundant updates and synchronization with the physics engine. The view frustrum culling improvement consists in using the DBVT broadphase facility of Bullet to build a tree of graphical objects in the scene. The elements of the tree are Aabb boxes (Aligned Axis Bounding Boxes) enclosing the objects. This provides good precision in closed and opened scenes. This new culling system is enabled by default but just in case, it can be disabled with a button in the World settings. There is no do_version in this commit but it will be added before the 2.49 release. For now you must manually enable the DBVT culling option in World settings when you open an old file. The above improvements speed up scenegraph and culling up to 5x. However, this performance improvement is only visible when you have hundreds or thousands of objects. The main interest of the DBVT tree is to allow easy occlusion culling and automatic LOD system. This will be the object of further improvements.
134 lines
3.5 KiB
C++
134 lines
3.5 KiB
C++
/**
|
|
* $Id$
|
|
*
|
|
* ***** 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, 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 *****
|
|
* Bounding Box
|
|
*/
|
|
|
|
#ifndef __SG_BBOX_H__
|
|
#define __SG_BBOX_H__
|
|
|
|
#include "MT_Scalar.h"
|
|
#include "MT_Point3.h"
|
|
#include "MT_Vector3.h"
|
|
#include "MT_Transform.h"
|
|
|
|
#include <vector>
|
|
|
|
class SG_Node;
|
|
|
|
/**
|
|
* Bounding box class.
|
|
* Holds the minimum and maximum axis aligned points of a node's bounding box,
|
|
* in world coordinates.
|
|
*/
|
|
class SG_BBox
|
|
{
|
|
MT_Point3 m_min;
|
|
MT_Point3 m_max;
|
|
public:
|
|
typedef enum { INSIDE, INTERSECT, OUTSIDE } intersect;
|
|
SG_BBox();
|
|
SG_BBox(const MT_Point3 &min, const MT_Point3 &max);
|
|
SG_BBox(const SG_BBox &other, const MT_Transform &world);
|
|
SG_BBox(const SG_BBox &other);
|
|
~SG_BBox();
|
|
|
|
/**
|
|
* Enlarges the bounding box to contain the specified point.
|
|
*/
|
|
SG_BBox& operator +=(const MT_Point3 &point);
|
|
/**
|
|
* Enlarges the bounding box to contain the specified bound box.
|
|
*/
|
|
SG_BBox& operator +=(const SG_BBox &bbox);
|
|
|
|
SG_BBox operator + (const SG_BBox &bbox2) const;
|
|
#if 0
|
|
/**
|
|
* Translates the bounding box.
|
|
*/
|
|
void translate(const MT_Vector3 &dx);
|
|
/**
|
|
* Scales the bounding box about the optional point.
|
|
*/
|
|
void scale(const MT_Vector3 &size, const MT_Point3 &point = MT_Point3(0., 0., 0.));
|
|
#endif
|
|
SG_BBox transform(const MT_Transform &world) const;
|
|
/**
|
|
* Computes the volume of the bounding box.
|
|
*/
|
|
MT_Scalar volume() const;
|
|
|
|
/**
|
|
* Test if the given point is inside this bounding box.
|
|
*/
|
|
bool inside(const MT_Point3 &point) const;
|
|
|
|
/**
|
|
* Test if the given bounding box is inside this bounding box.
|
|
*/
|
|
bool inside(const SG_BBox &other) const;
|
|
|
|
/**
|
|
* Test if the given bounding box is outside this bounding box.
|
|
*/
|
|
bool outside(const SG_BBox &other) const;
|
|
|
|
/**
|
|
* Test if the given bounding box intersects this bounding box.
|
|
*/
|
|
bool intersects(const SG_BBox &other) const;
|
|
|
|
/**
|
|
* Test the given bounding box with this bounding box.
|
|
*/
|
|
intersect test(const SG_BBox &other) const;
|
|
|
|
/**
|
|
* Get the eight points that define this bounding box.
|
|
*
|
|
* @param world a world transform to apply to the produced points bounding box.
|
|
*/
|
|
void get(MT_Point3 *box, const MT_Transform &world) const;
|
|
/**
|
|
* Get the eight points that define this axis aligned bounding box.
|
|
* This differs from SG_BBox::get() in that the produced box will be world axis aligned.
|
|
* The maximum & minimum local points will be transformed *before* splitting to 8 points.
|
|
* @param world a world transform to be applied.
|
|
*/
|
|
void getaa(MT_Point3 *box, const MT_Transform &world) const;
|
|
|
|
void getmm(MT_Point3 *box, const MT_Transform &world) const;
|
|
|
|
void split(SG_BBox &left, SG_BBox &right) const;
|
|
|
|
friend class SG_Tree;
|
|
|
|
};
|
|
|
|
#endif /* __SG_BBOX_H__ */
|