-
Notifications
You must be signed in to change notification settings - Fork 20
/
romalignertilting.cpp
178 lines (147 loc) · 5.04 KB
/
romalignertilting.cpp
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
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
#include "romalignertilting.h"
#include "maskromtool.h"
/* All comparisons and sorts are performed on tilted bit positions.
* This tilt is based upon the angle of the top row in the previous
* alignment, and that angle is not saved between runs of the program.
*
* Aside from the QTransform mapping, this is the same as RomAlignerReliable.
*/
static QTransform transform;
static bool leftOf(RomBitItem * left, RomBitItem * right){
auto l=transform.map(left->pos());
auto r=transform.map(right->pos());
return l.x() < r.x();
}
static bool above(RomBitItem * top, RomBitItem * bottom){
auto t=transform.map(top->pos());
auto b=transform.map(bottom->pos());
return t.y() < b.y();
}
RomAlignerTilting::RomAlignerTilting() {
name="RomAlignerTilting";
transform=QTransform();
}
qreal RomAlignerTilting::angle(){
RomBitItem *first, *last;
//Fail out with zero degrees.
if(rowstarts.empty())
return 0.0;
first=rowstarts[0];
last=first;
while(last->nexttoright)
last=last->nexttoright;
QPointF left=first->pos(), right=last->pos();
QLineF line(left, right);
lastangle=line.angle();
transform=QTransform().rotate(lastangle);
angleset=true;
/* How well did the transform work?
auto l=transform.map(left), r=transform.map(right);
auto newangle=QLineF(l,r).angle();
qDebug()<<"Post transform, angle is "<<newangle; //Very small, we hope.
*/
return lastangle;
}
RomBitItem* RomAlignerTilting::markBitTable(MaskRomTool* mrt){
QList<RomBitItem *> bits=mrt->bits;
//The very first time we align this, we continuously update the transform.
bool firstrun=!angleset;
//We recalculate the transformation whenever this grows by 16.
int bitcount=0;
//First we remove all the old bit marks and pointers.
foreach (RomBitItem* bit, bits){
//Clear the markup details.
bit->marked=false; //Not used by this aligner.
bit->nextrow=0;
bit->nexttoright=0;
bit->lastinrow=0; //Speeds up linked list usage.
bit->row=-1;
bit->col=-1;
}
rowstarts.clear();
leftsorted.clear();
// We'll need presorted collections by X and Y.
for(RomBitItem *bit: bits){
leftsorted<<bit;
}
//We read each row from the left. Presorting doesn't help determinism.
std::sort(leftsorted.begin(), leftsorted.end(), leftOf);
//Each bit is either its own row or the next in an existing row.
for(RomBitItem *bit: leftsorted){
RomBitItem* nearest=nearestBit(bit);
if(!nearest){ //First bit is its own row.
rowstarts<<bit;
}else{
auto nearestpos=transform.map(nearest->pos());
auto bitpos=transform.map(bit->pos());
qreal dx=qFabs(nearestpos.x()-bitpos.x());
qreal dy=qFabs(nearestpos.y()-bitpos.y());
if(dx<dy){ //New row because Y distance is greater.
rowstarts<<bit;
}else{ //Existing row because X distance is greater.
nearest->nexttoright=bit;
if(firstrun) angle();
}
}
}
return linkresults();
}
//Nearest bit from existing rows.
RomBitItem* RomAlignerTilting::nearestBit(RomBitItem *item){
/* This returns the best match, but it does not guarantee that it
* is a good match. If the best match is further in Y than in
* X, you should start a new row.
*/
RomBitItem* nearest=0;
qreal nearestdy=1000.0;
auto itempos=transform.map(item->pos());
for(RomBitItem* bit: rowstarts){
/* Rather than chase the entire linked list, we try to keep the frist
* bit of each row pointing to either the end or some item near the end.
*
* We compare the mapped positions, not the raw positions.
*/
RomBitItem* startbit=bit;
if(bit->lastinrow)
bit=bit->lastinrow;
while(bit->nexttoright) bit=bit->nexttoright;
startbit->lastinrow=bit;
auto bitpos=transform.map(bit->pos());
qreal dy=qFabs(itempos.y()-bitpos.y());
if(dy<nearestdy){
nearestdy=dy;
nearest=bit;
}
}
return nearest;
}
//This updates the linked lists that MRT uses internally.
RomBitItem* RomAlignerTilting::linkresults(){
//Having assembled rows, we now need to sort them and return the top left.
std::sort(rowstarts.begin(), rowstarts.end(), above);
//Apply the linked list.
RomBitItem* lastbit=0;
for(RomBitItem *bit: rowstarts){
if(lastbit)
lastbit->nextrow=bit;
lastbit=bit;
}
//Number the bits by row and column.
int expectedcols=0;
int row=0;
for(RomBitItem* bit: rowstarts){
int col=0;
while(bit){
bit->col=col;
bit->row=row;
bit=bit->nexttoright;
col++;
}
row++;
}
//Do I want to correct by a tilt or by a shear?
qDebug()<<"Tilt angle of the first row after alignment is "<<angle();
if(row)
return rowstarts[0];
return 0;
}