1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
|
#include "mrgingham.hh"
#include "mrgingham-internal.h"
#include <stdio.h>
#include <getopt.h>
using namespace mrgingham;
static bool read_points( std::vector<PointInt>* points, const char* file )
{
FILE* fp = fopen(file, "r");
if( fp == NULL )
{
fprintf(stderr, "couldn't open '%s'\n", file);
return false;
}
char* line = NULL;
size_t n = 0;
while(getline(&line, &n, fp) >= 0)
{
double x,y;
int Nread = sscanf(line, "%lf %lf", &x, &y);
if(Nread != 2)
continue;
PointInt pt( (int)( x * FIND_GRID_SCALE + 0.5 ),
(int)( y * FIND_GRID_SCALE + 0.5 ) );
points->push_back(pt);
}
fclose(fp);
free(line);
return true;
}
int main(int argc, char* argv[])
{
const char* usage =
"Usage: %s [--debug] points.vnl\n"
"\n"
"Given a set of pre-detected points, this tool finds a chessboard grid, and returns\n"
"the ordered coordinates of this grid on standard output. The pre-detected points\n"
"can come from something like test-dump-chessboard-corners.\n"
"\n"
"We detect an NxN grid of corners, where N defaults to 10. To select a different\n"
"value, pass --gridn N\n";
struct option opts[] = {
{ "gridn", required_argument, NULL, 'N' },
{ "help", no_argument, NULL, 'h' },
{ "debug", no_argument, NULL, 'd' },
{}
};
int gridn = 10;
bool debug = false;
int opt;
do
{
// "h" means -h does something
opt = getopt_long(argc, argv, "h", opts, NULL);
switch(opt)
{
case -1:
break;
case 'h':
printf(usage, argv[0]);
return 0;
case 'd':
debug = true;
break;
case 'N':
gridn = atoi(optarg);
break;
case '?':
fprintf(stderr, "Unknown option\n");
fprintf(stderr, usage, argv[0]);
return 1;
}
} while( opt != -1 );
if( optind != argc-1)
{
fprintf(stderr, "Need a single points-file on the cmdline\n");
fprintf(stderr, usage, argv[0]);
return 1;
}
if(gridn < 2)
{
fprintf(stderr, "--gridn value must be >= 2\n");
return 1;
}
std::vector<PointInt> points;
if( !read_points(&points, argv[argc-1]) )
return 1;
std::vector<PointDouble> points_out;
bool result = find_grid_from_points(points_out, points, gridn, debug);
printf("# x y\n");
if( result )
{
for(int i=0; i<(int)points_out.size(); i++)
printf("%f %f\n", points_out[i].x, points_out[i].y);
return 0;
}
return 1;
}
|
