/
algoMaxRects.cpp
227 lines (173 loc) · 8.53 KB
/
algoMaxRects.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
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
/*
-------------------------------------------------------------------------
This file is part of PixelPacker, tools to pack textures into as small as space as possible.
PixelPacker version 1 of 6 March 2011
Copyright (C) 2011 Ethan Steinberg <ethan.steinberg@gmail.com>
This program is released under the terms of the license contained
in the file COPYING.
---------------------------------------------------------------------------
*/
#include "algoMaxRects.h"
#include "myBox.h"
#include <iostream>
#include <stdexcept>
#include <vector>
#include <set>
#include <list>
#include <algorithm>
#include <assert.h>
std::multimap<t_myVector2, t_myVector2> pack(const std::vector< t_myVector2> &temp, const t_myVector2 &size, bool &fine)
{
std::list<t_myBox> freeBoxes;
freeBoxes.push_back(t_myBox(0,0,size.x,size.y));
std::list<t_myVector2> rects(temp.begin(), temp.end());
std::multimap<t_myVector2, t_myVector2> boxes;
while (!rects.empty())
{
int min = std::max(size.x,size.y);
std::list<t_myVector2>::iterator minIterRects = rects.end();
std::list<t_myBox>::iterator minIterFreeBoxes = freeBoxes.end();
for (auto iterRects = rects.begin(); iterRects != rects.end(); iterRects++)
{
for (auto iterFreeBoxes = freeBoxes.begin(); iterFreeBoxes != freeBoxes.end(); iterFreeBoxes++)
{
int distance = std::min(iterFreeBoxes->size.y - iterRects->y, iterFreeBoxes->size.x - iterRects->x);
if (distance < 0)
{
//std::cout<<"The box "<<iterFreeBoxes->pos<<" with a size "<<iterFreeBoxes->size<<" is too small for "<<*iterRects<<std::endl;
continue;
}
if (distance < min)
{
//std::cout<<"The box "<<iterFreeBoxes->pos<<" with a size "<<iterFreeBoxes->size<<" is ok for "<<*iterRects<<std::endl;
min = distance;
minIterRects = iterRects;
minIterFreeBoxes = iterFreeBoxes;
}
}
}
if (minIterRects == rects.end() || minIterFreeBoxes == freeBoxes.end())
{
return std::multimap<t_myVector2, t_myVector2>();
}
//std::cout<<"I am placing the box "<<*minIterRects<<" into the position "<<minIterFreeBoxes->pos<<std::endl;
//std::cout<<minIterFreeBoxes->pos<<std::endl;
t_myBox insertedBox = t_myBox(minIterFreeBoxes->pos,*minIterRects);
boxes.insert(std::make_pair(*minIterRects,minIterFreeBoxes->pos));
freeBoxes.push_front(t_myBox(
t_myVector2(
minIterFreeBoxes->pos.x + minIterRects->x,
minIterFreeBoxes->pos.y + 0),
t_myVector2(
minIterFreeBoxes->size.x - minIterRects->x,
minIterFreeBoxes->size.y)
));
freeBoxes.push_front(t_myBox(
t_myVector2(
minIterFreeBoxes->pos.x + 0,
minIterFreeBoxes->pos.y + minIterRects->y),
t_myVector2(
minIterFreeBoxes->size.x,
minIterFreeBoxes->size.y - minIterRects->y)
));
freeBoxes.erase(minIterFreeBoxes);
t_myVector2 a1 = insertedBox.pos;
t_myVector2 a2 = t_myVector2(insertedBox.pos.x + insertedBox.size.x,insertedBox.pos.y);
t_myVector2 a3 = t_myVector2(insertedBox.pos.x + insertedBox.size.x,insertedBox.pos.y + insertedBox.size.y);
t_myVector2 a4 = t_myVector2(insertedBox.pos.x ,insertedBox.pos.y + insertedBox.size.y);
for (auto iterFreeBoxes = freeBoxes.begin(); iterFreeBoxes != freeBoxes.end();)
{
assert(iterFreeBoxes != freeBoxes.end());
//assert(!(iterFreeBoxes->pos == insertedBox.pos));
t_myVector2 b1 = iterFreeBoxes->pos;
t_myVector2 b2 = t_myVector2(iterFreeBoxes->pos.x + iterFreeBoxes->size.x,iterFreeBoxes->pos.y);
t_myVector2 b3 = t_myVector2(iterFreeBoxes->pos.x + iterFreeBoxes->size.x,iterFreeBoxes->pos.y + iterFreeBoxes->size.y);
t_myVector2 b4 = t_myVector2(iterFreeBoxes->pos.x ,iterFreeBoxes->pos.y + iterFreeBoxes->size.y);
if ((a1.x >= b3.x) || (a1.y >= b3.y) ||
(a3.x <= b1.x) || (a3.y <= b1.y))
{
iterFreeBoxes++;
continue; // not intersecting
}
if ((a1.x > b1.x) /* && (a1.x < b3.x) */) // If there is a chance that line a1,a2 is in the shape b
{
freeBoxes.push_front(t_myBox(
t_myVector2(
iterFreeBoxes->pos.x,
iterFreeBoxes->pos.y),
t_myVector2(
a1.x - b1.x,
iterFreeBoxes->size.y)
));
}
if ((a3.x < b3.x) /* && (a1.x < b3.x) */) // If there is a chance that line a1,a2 is in the shape b
{
freeBoxes.push_front(t_myBox(
t_myVector2(
a3.x,
iterFreeBoxes->pos.y),
t_myVector2(
b3.x - a3.x,
iterFreeBoxes->size.y)
));
}
if ((a1.y > b1.y) /* && (a1.x < b3.x) */) // If there is a chance that line a1,a2 is in the shape b
{
freeBoxes.push_front(t_myBox(
t_myVector2(
iterFreeBoxes->pos.x,
iterFreeBoxes->pos.y),
t_myVector2(
iterFreeBoxes->size.x,
a1.y - b1.y)
));
}
if ((a3.y < b3.y) /* && (a1.x < b3.x) */) // If there is a chance that line a1,a2 is in the shape b
{
freeBoxes.push_front(t_myBox(
t_myVector2(
iterFreeBoxes->pos.x,
a3.y),
t_myVector2(
iterFreeBoxes->size.x,
b3.y - a3.y)
));
}
auto blah = iterFreeBoxes++;
freeBoxes.erase(blah);
}
for (auto iterFreeBoxes = freeBoxes.begin(); iterFreeBoxes != freeBoxes.end(); iterFreeBoxes++)
{
assert(iterFreeBoxes != freeBoxes.end());
auto iterFreeBoxes2 = iterFreeBoxes;
iterFreeBoxes2++;
while ( iterFreeBoxes2 != freeBoxes.end())
{
assert(iterFreeBoxes != freeBoxes.end());
assert(iterFreeBoxes2 != freeBoxes.end());
assert(iterFreeBoxes != iterFreeBoxes2);
//assert(!((*iterFreeBoxes).pos == (*iterFreeBoxes2).pos));
t_myVector2 b1 = iterFreeBoxes->pos;
t_myVector2 b2 = t_myVector2(iterFreeBoxes->pos.x + iterFreeBoxes->size.x,iterFreeBoxes->pos.y);
t_myVector2 b3 = t_myVector2(iterFreeBoxes->pos.x + iterFreeBoxes->size.x,iterFreeBoxes->pos.y + iterFreeBoxes->size.y);
t_myVector2 b4 = t_myVector2(iterFreeBoxes->pos.x ,iterFreeBoxes->pos.y + iterFreeBoxes->size.y);
t_myVector2 c1 = iterFreeBoxes2->pos;
t_myVector2 c2 = t_myVector2(iterFreeBoxes2->pos.x + iterFreeBoxes2->size.x,iterFreeBoxes2->pos.y);
t_myVector2 c3 = t_myVector2(iterFreeBoxes2->pos.x + iterFreeBoxes2->size.x,iterFreeBoxes2->pos.y + iterFreeBoxes2->size.y);
t_myVector2 c4 = t_myVector2(iterFreeBoxes2->pos.x ,iterFreeBoxes2->pos.y + iterFreeBoxes2->size.y);
if (c1.x >= b1.x && c1.y >= b1.y &&
c3.x <= b3.x && c3.y <= b3.y)
{
//std::cout<<"Erasing a box "<<iterFreeBoxes->pos<<", "<<iterFreeBoxes->size<<" and "<<iterFreeBoxes2->pos<<", "<<iterFreeBoxes2->size<<std::endl;
auto blah = iterFreeBoxes2++;
freeBoxes.erase(blah);
}
else
iterFreeBoxes2++;
}
}
rects.erase(minIterRects);
}
fine = 1;
return boxes;
}