projects
/
folded-ctf.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
automatic commit
[folded-ctf.git]
/
pose_cell_hierarchy.h
diff --git
a/pose_cell_hierarchy.h
b/pose_cell_hierarchy.h
index
2ecfde9
..
c04e3b0
100644
(file)
--- a/
pose_cell_hierarchy.h
+++ b/
pose_cell_hierarchy.h
@@
-12,10
+12,21
@@
// You should have received a copy of the GNU General Public License //
// along with this program. If not, see <http://www.gnu.org/licenses/>. //
// //
// 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 //
///////////////////////////////////////////////////////////////////////////
// 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
#ifndef POSE_CELL_HIERARCHY_H
#define POSE_CELL_HIERARCHY_H
@@
-38,7
+49,7
@@
class PoseCellHierarchy {
int _nb_levels;
scalar_t _min_head_radius;
scalar_t _max_head_radius;
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;
int _nb_belly_cells;