Open CASCADE Technology
7.0.0

A tool to compare a 2D bounding box with a set of 2D bounding boxes. It sorts the set of bounding boxes to give the list of boxes which intersect the element being compared. The boxes being sorted generally bound a set of shapes, while the box being compared bounds a shape to be compared. The resulting list of intersecting boxes therefore gives the list of items which potentially intersect the shape to be compared. More...
#include <Bnd_BoundSortBox2d.hxx>
Public Member Functions  
Bnd_BoundSortBox2d ()  
Constructs an empty comparison algorithm for 2D bounding boxes. The bounding boxes are then defined using the Initialize function. More...  
void  Initialize (const Bnd_Box2d &CompleteBox, const Handle< Bnd_HArray1OfBox2d > &SetOfBox) 
Initializes this comparison algorithm with. More...  
void  Initialize (const Handle< Bnd_HArray1OfBox2d > &SetOfBox) 
Initializes this comparison algorithm with. More...  
void  Initialize (const Bnd_Box2d &CompleteBox, const Standard_Integer nbComponents) 
Initializes this comparison algorithm, giving it only. More...  
void  Add (const Bnd_Box2d &theBox, const Standard_Integer boxIndex) 
Adds the 2D bounding box theBox at position boxIndex in the array of boxes to be sorted by this comparison algorithm. This function is used only in conjunction with the third syntax described in the synopsis of Initialize. Exceptions. More...  
const TColStd_ListOfInteger &  Compare (const Bnd_Box2d &theBox) 
Compares the 2D bounding box theBox with the set of bounding boxes to be sorted by this comparison algorithm, and returns the list of intersecting bounding boxes as a list of indexes on the array of bounding boxes used by this algorithm. More...  
void  Dump () const 
A tool to compare a 2D bounding box with a set of 2D bounding boxes. It sorts the set of bounding boxes to give the list of boxes which intersect the element being compared. The boxes being sorted generally bound a set of shapes, while the box being compared bounds a shape to be compared. The resulting list of intersecting boxes therefore gives the list of items which potentially intersect the shape to be compared.
Bnd_BoundSortBox2d::Bnd_BoundSortBox2d  (  ) 
Constructs an empty comparison algorithm for 2D bounding boxes. The bounding boxes are then defined using the Initialize function.
void Bnd_BoundSortBox2d::Add  (  const Bnd_Box2d &  theBox, 
const Standard_Integer  boxIndex  
) 
Adds the 2D bounding box theBox at position boxIndex in the array of boxes to be sorted by this comparison algorithm. This function is used only in conjunction with the third syntax described in the synopsis of Initialize. Exceptions.
const TColStd_ListOfInteger& Bnd_BoundSortBox2d::Compare  (  const Bnd_Box2d &  theBox  ) 
Compares the 2D bounding box theBox with the set of bounding boxes to be sorted by this comparison algorithm, and returns the list of intersecting bounding boxes as a list of indexes on the array of bounding boxes used by this algorithm.
void Bnd_BoundSortBox2d::Dump  (  )  const 
void Bnd_BoundSortBox2d::Initialize  (  const Bnd_Box2d &  CompleteBox, 
const Handle< Bnd_HArray1OfBox2d > &  SetOfBox  
) 
Initializes this comparison algorithm with.
void Bnd_BoundSortBox2d::Initialize  (  const Handle< Bnd_HArray1OfBox2d > &  SetOfBox  ) 
Initializes this comparison algorithm with.
void Bnd_BoundSortBox2d::Initialize  (  const Bnd_Box2d &  CompleteBox, 
const Standard_Integer  nbComponents  
) 
Initializes this comparison algorithm, giving it only.