#include <iostream>
#include <fstream>
+#include <stdlib.h>
using namespace std;
// Here our example is a 1D space with motions from any location to
// any location less than motion_amplitude away, entrance at
- // location 0 and exit at location nb_locations-1.
+ // location 0 (or in the first time frame, i.e. targets can already
+ // be in the scene when the sequence starts) and exit at location
+ // nb_locations-1 (or from the last time frame, i.e. targets can
+ // still be present when the sequence finishes)
for(int l = 0; l < nb_locations; l++) {
- for(int k = 0; k < nb_locations; k++) {
- tracker->allowed_motion[l][k] = abs(l - k) <= motion_amplitude;
+ for(int m = 0; m < nb_locations; m++) {
+ tracker->allowed_motions[l][m] = abs(l - m) <= motion_amplitude;
+ }
+ }
+
+ for(int t = 0; t < nb_time_steps; t++) {
+ for(int l = 0; l < nb_locations; l++) {
+ // We allow targets to enter in the first time frame, or in
+ // location 0
+ tracker->entrances[t][l] = (t == 0 || l == 0);
+ // We allow targets to leave from the last time frame, or from
+ // location nb_locations-1
+ tracker->exits[t][l] = (t == nb_time_steps - 1 || l == nb_locations-1);
}
- tracker->entrances[0] = 1;
- tracker->exits[nb_locations - 1] = 1;
}
// We construct the graph corresponding to this structure
<< " starting at " << tracker->trajectory_entrance_time(t)
<< ", duration " << tracker->trajectory_duration(t)
<< ", score " << tracker->trajectory_score(t)
- << ", through nodes ";
+ << ", through locations";
for(int u = 0; u < tracker->trajectory_duration(t); u++) {
cout << " " << tracker->trajectory_location(t, u);
}