class Sp_Tree: public Sp_MBox

The Tree World.

Inheritance:


Public Methods

[more] Sp_Tree(Sp_Box &b, int granu=4, int dp=0)
Constructor: We give a box which contains world
[more] Sp_Tree()
if we use the constructor without args, you must call the init function
[more]void Init(const Sp_Box &b, int granu=4, int dp=0)
Init function
[more]void Insert(Sp_FaceC *, const Sp_Box &)
Add Element to build the Tree
[more]void FindList(list<Sp_FaceC *> &, const Sp_Point &)
find a list of element T which could contain point P
[more]void FindList(list<Sp_FaceC *> &, const Sp_Box &)
find a list of element T which could intersect box B
[more]void FindList(list<Sp_FaceC *> &, const Sp_Sphere &)
find a list of element T which could intersect Sphere S

Private Fields

[more]char node
Is this Tree a node ?
[more]list<Sp_FaceC *> elements
if it is node, elements are in this list
[more]Sp_Tree* indirection
if not, we have an indirection
[more]int depth
Depth of this Leaf

Private Methods

[more]void Add_Liste(list<Sp_FaceC *> &l, list<Sp_FaceC *> &l2)
Ajoute une liste a une autre
[more]void CreateDepth()
Create a deeper tree


Inherited from Sp_MBox:

Public Fields

oint nbstep


Documentation

The Tree World. Many constants are defined in sp_circuit.cpp
o Sp_Tree(Sp_Box &b, int granu=4, int dp=0)
Constructor: We give a box which contains world

o Sp_Tree()
if we use the constructor without args, you must call the init function

ovoid Init(const Sp_Box &b, int granu=4, int dp=0)
Init function

ovoid Insert(Sp_FaceC *, const Sp_Box &)
Add Element to build the Tree

ovoid FindList(list<Sp_FaceC *> &, const Sp_Point &)
find a list of element T which could contain point P

ovoid FindList(list<Sp_FaceC *> &, const Sp_Box &)
find a list of element T which could intersect box B

ovoid FindList(list<Sp_FaceC *> &, const Sp_Sphere &)
find a list of element T which could intersect Sphere S

ovoid Add_Liste(list<Sp_FaceC *> &l, list<Sp_FaceC *> &l2)
Ajoute une liste a une autre

ovoid CreateDepth()
Create a deeper tree

ochar node
Is this Tree a node ?

olist<Sp_FaceC *> elements
if it is node, elements are in this list

oSp_Tree* indirection
if not, we have an indirection

oint depth
Depth of this Leaf


This class has no child classes.

Alphabetic index HTML hierarchy of classes or Java



This page was generated with the help of DOC++.