2009-02-17 10:27:49 +05:00
|
|
|
|
// Copyright (C) 2007-2008 CEA/DEN, EDF R&D, OPEN CASCADE
|
2007-01-22 20:14:44 +05:00
|
|
|
|
//
|
2009-02-17 10:27:49 +05:00
|
|
|
|
// Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
|
2007-01-22 20:14:44 +05:00
|
|
|
|
// CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
|
|
|
|
|
//
|
|
|
|
|
// This library is free software; you can redistribute it and/or
|
|
|
|
|
// modify it under the terms of the GNU Lesser General Public
|
|
|
|
|
// License as published by the Free Software Foundation; either
|
|
|
|
|
// version 2.1 of the License.
|
|
|
|
|
//
|
|
|
|
|
// This library 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
|
|
|
|
|
// Lesser General Public License for more details.
|
|
|
|
|
//
|
|
|
|
|
// You should have received a copy of the GNU Lesser General Public
|
|
|
|
|
// License along with this library; if not, write to the Free Software
|
|
|
|
|
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
|
|
|
//
|
2009-02-17 10:27:49 +05:00
|
|
|
|
// See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
|
2007-01-22 20:14:44 +05:00
|
|
|
|
//
|
2009-02-17 10:27:49 +05:00
|
|
|
|
// SMESH SMESH_Octree : global Octree implementation
|
|
|
|
|
//
|
2009-04-03 14:54:51 +06:00
|
|
|
|
// File : SMESH_Octree.hxx
|
|
|
|
|
// Created : Tue Jan 16 16:00:00 2007
|
|
|
|
|
// Author : Nicolas Geimer & Aur<75>lien Motteux (OCC)
|
|
|
|
|
// Module : SMESH
|
|
|
|
|
|
2007-01-22 20:14:44 +05:00
|
|
|
|
#ifndef _SMESH_OCTREE_HXX_
|
|
|
|
|
#define _SMESH_OCTREE_HXX_
|
|
|
|
|
|
|
|
|
|
#include <Bnd_B3d.hxx>
|
|
|
|
|
|
|
|
|
|
class SMESH_Octree {
|
|
|
|
|
|
|
|
|
|
public:
|
|
|
|
|
|
2009-09-10 11:49:16 +06:00
|
|
|
|
// Data limiting the tree height
|
|
|
|
|
struct Limit {
|
|
|
|
|
// MaxLevel of the Octree
|
|
|
|
|
int myMaxLevel;
|
|
|
|
|
// Minimal size of the Box
|
|
|
|
|
double myMinBoxSize;
|
2007-01-22 20:14:44 +05:00
|
|
|
|
|
2009-09-10 11:49:16 +06:00
|
|
|
|
// Default:
|
|
|
|
|
// maxLevel-> 8^8 = 16777216 terminal trees
|
|
|
|
|
// minSize -> box size not checked
|
|
|
|
|
Limit(int maxLevel=8, double minSize=0.):myMaxLevel(maxLevel),myMinBoxSize(minSize) {}
|
|
|
|
|
virtual ~Limit() {} // it can be inherited
|
|
|
|
|
};
|
2007-01-22 20:14:44 +05:00
|
|
|
|
|
2009-09-10 11:49:16 +06:00
|
|
|
|
// Constructor. limit must be provided at tree root construction.
|
|
|
|
|
// limit will be deleted by SMESH_Octree
|
|
|
|
|
SMESH_Octree (Limit* limit=0);
|
2007-01-22 20:14:44 +05:00
|
|
|
|
|
2009-09-10 11:49:16 +06:00
|
|
|
|
// Destructor
|
|
|
|
|
virtual ~SMESH_Octree ();
|
2007-01-22 20:14:44 +05:00
|
|
|
|
|
2009-09-10 11:49:16 +06:00
|
|
|
|
// Compute the Octree. Must be called by constructor of inheriting class
|
|
|
|
|
void compute();
|
2007-01-22 20:14:44 +05:00
|
|
|
|
|
2009-09-10 11:49:16 +06:00
|
|
|
|
// Tell if Octree is a leaf or not.
|
|
|
|
|
// An inheriting class can influence it via myIsLeaf protected field
|
|
|
|
|
bool isLeaf() const;
|
2007-01-22 20:14:44 +05:00
|
|
|
|
|
2008-03-07 12:47:05 +05:00
|
|
|
|
// Return its level
|
|
|
|
|
int level() const { return myLevel; }
|
|
|
|
|
|
2009-09-10 11:49:16 +06:00
|
|
|
|
// Get box to the 3d Bounding Box of the Octree
|
|
|
|
|
const Bnd_B3d& getBox() const { return *myBox; }
|
|
|
|
|
|
|
|
|
|
// Compute the bigger dimension of my box
|
|
|
|
|
double maxSize() const;
|
|
|
|
|
|
|
|
|
|
// Return index of a child the given point is in
|
|
|
|
|
inline int getChildIndex(double x, double y, double z, const gp_XYZ& boxMiddle)const;
|
|
|
|
|
|
2007-01-22 20:14:44 +05:00
|
|
|
|
protected:
|
2009-09-10 11:49:16 +06:00
|
|
|
|
// Return box of the whole tree
|
|
|
|
|
virtual Bnd_B3d* buildRootBox() = 0;
|
2007-01-22 20:14:44 +05:00
|
|
|
|
|
2009-09-10 11:49:16 +06:00
|
|
|
|
// Constructor for children
|
|
|
|
|
virtual SMESH_Octree* allocateOctreeChild() const = 0;
|
2007-01-22 20:14:44 +05:00
|
|
|
|
|
2009-09-10 11:49:16 +06:00
|
|
|
|
// Build the data in the 8 children
|
|
|
|
|
virtual void buildChildrenData() = 0;
|
2007-01-22 20:14:44 +05:00
|
|
|
|
|
|
|
|
|
// members
|
|
|
|
|
|
|
|
|
|
// Array of 8 Octree children
|
|
|
|
|
SMESH_Octree** myChildren;
|
|
|
|
|
|
|
|
|
|
// Point the father, set to NULL for the level 0
|
|
|
|
|
SMESH_Octree* myFather;
|
|
|
|
|
|
2009-09-10 11:49:16 +06:00
|
|
|
|
// Tell us if the Octree is a leaf or not
|
|
|
|
|
bool myIsLeaf;
|
|
|
|
|
|
|
|
|
|
// Tree limit
|
|
|
|
|
const Limit* myLimit;
|
|
|
|
|
|
|
|
|
|
private:
|
|
|
|
|
// Build the 8 children boxes recursively
|
|
|
|
|
void buildChildren();
|
|
|
|
|
|
2007-01-22 20:14:44 +05:00
|
|
|
|
// Level of the Octree
|
|
|
|
|
int myLevel;
|
|
|
|
|
|
2009-09-10 11:49:16 +06:00
|
|
|
|
Bnd_B3d* myBox;
|
|
|
|
|
};
|
2007-01-22 20:14:44 +05:00
|
|
|
|
|
2009-09-10 11:49:16 +06:00
|
|
|
|
//================================================================================
|
|
|
|
|
/*!
|
|
|
|
|
* \brief Return index of a child the given point is in
|
|
|
|
|
*/
|
|
|
|
|
//================================================================================
|
2007-01-22 20:14:44 +05:00
|
|
|
|
|
2009-09-10 11:49:16 +06:00
|
|
|
|
inline int SMESH_Octree::getChildIndex(double x, double y, double z, const gp_XYZ& mid) const
|
|
|
|
|
{
|
|
|
|
|
return (x > mid.X()) + ( y > mid.Y())*2 + (z > mid.Z())*4;
|
|
|
|
|
}
|
2009-04-03 14:54:51 +06:00
|
|
|
|
|
2007-01-22 20:14:44 +05:00
|
|
|
|
#endif
|