// You should have received a copy of the GNU General Public License //
// along with this program. If not, see <http://www.gnu.org/licenses/>. //
// //
-// Written by Francois Fleuret, (C) IDIAP //
+// Written by Francois Fleuret //
+// (C) Idiap Research Institute //
+// //
// Contact <francois.fleuret@idiap.ch> for comments & bug reports //
///////////////////////////////////////////////////////////////////////////
+/*
+
+ A PoseCellHierarchy provides the necessary methods to visit a
+ recursive partitioning of the pose space. The two main methods can
+ give you an root partitioning, or compute a finer partitioning from
+ an existing one.
+
+ */
+
#ifndef POSE_CELL_HIERARCHY_H
#define POSE_CELL_HIERARCHY_H
int _nb_levels;
scalar_t _min_head_radius;
scalar_t _max_head_radius;
- int _root_cell_nb_xy_per_scale;
+ int _root_cell_nb_xy_per_radius;
int _nb_belly_cells;