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
|
/****************************************************************************
* VCGLib o o *
* Visual and Computer Graphics Library o o *
* _ O _ *
* Copyright(C) 2004 \/)\/ *
* Visual Computing Lab /\/| *
* ISTI - Italian National Research Council | *
* \ *
* All rights reserved. *
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation; either version 2 of the License, or *
* (at your option) any later version. *
* *
* This program is distributed in the hope that it will be useful, *
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
* GNU General Public License (http://www.gnu.org/licenses/gpl.txt) *
* for more details. *
* *
****************************************************************************/
#ifndef __VCG_POLY_PACKER_H__
#define __VCG_POLY_PACKER_H__
#include <limits>
#include <stdio.h>
#include <assert.h>
#include <algorithm>
#include <vector>
#include <vcg/space/box2.h>
#include <vcg/space/rect_packer.h>
#include <vcg/space/point2.h>
#include <vcg/math/similarity2.h>
namespace vcg
{
template <class SCALAR_TYPE>
class PolyPacker
{
typedef typename vcg::Box2<SCALAR_TYPE> Box2x;
typedef typename vcg::Point2<SCALAR_TYPE> Point2x;
typedef typename vcg::Similarity2<SCALAR_TYPE> Similarity2x;
public:
static Box2f getPolyBB(const std::vector<Point2x> &poly)
{
Box2f bb;
for(size_t i=0;i<poly.size();++i)
bb.Add(poly[i]);
return bb;
}
static Box2f getPolyOOBB(const std::vector<Point2x> &poly, float &rot)
{
const int stepNum=16;
float bestAngle;
float bestArea = std::numeric_limits<float>::max();
Box2f bestBB;
for(int i=0;i<stepNum;++i)
{
float angle = float(i)*(M_PI/2.0)/float(stepNum);
Box2f bb;
for(size_t i=0;i<poly.size();++i)
{
Point2f pp=poly[i];
pp.Rotate(angle);
bb.Add(pp);
}
if(bb.Area()<bestArea)
{
bestAngle=angle;
bestArea=bb.Area();
bestBB=bb;
}
}
rot=bestAngle;
return bestBB;
}
static bool PackAsEqualSquares(const std::vector< std::vector<Point2x> > &polyVec,
const Point2x containerSizeX,
std::vector<Similarity2x> &trVec,
Point2x &coveredContainer)
{
int minSide = int(min(containerSizeX[0],containerSizeX[1]));
const vcg::Point2i containerSize(minSide,minSide);
int polyPerLine = ceil(sqrt((double)polyVec.size()));
int pixelPerPoly = minSide / (polyPerLine);
if(pixelPerPoly < 1) return false;
trVec.clear();
trVec.resize(polyVec.size());
Box2f bbMax;
std::vector<Box2x> bbVec;
for(size_t i=0;i<polyVec.size();++i)
{
bbVec.push_back(getPolyBB(polyVec[i]));
bbMax.Add(bbVec.back());
}
float unitScale = 1.0/std::max(bbMax.DimX(), bbMax.DimY());
float polyScale = unitScale * pixelPerPoly;
int baseX =0;
int baseY=0;
for(size_t i=0;i<polyVec.size();++i)
{
trVec[i].sca = polyScale; // the same scaling for all the polygons;
trVec[i].tra = Point2f(baseX+(0.5*pixelPerPoly), baseY+(0.5*pixelPerPoly)) - bbVec[i].Center()*polyScale;
baseX +=pixelPerPoly;
if(baseX +pixelPerPoly>minSide)
{
baseY+=pixelPerPoly;
baseX=0;
}
}
return true;
}
static bool PackAsAxisAlignedRect(const std::vector< std::vector<Point2x> > &polyVec,
const Point2x containerSizeX,
std::vector<Similarity2x> &trVec,
Point2x &coveredContainer)
{
trVec.clear();
trVec.resize(polyVec.size());
std::vector<Box2x> bbVec;
for(size_t i=0;i<polyVec.size();++i)
{
assert(polyVec[i].size()>0);
bbVec.push_back(getPolyBB(polyVec[i]));
}
return RectPacker<float>::Pack(bbVec,containerSizeX,trVec,coveredContainer);
}
static bool PackAsObjectOrientedRect(const std::vector< std::vector<Point2x> > &polyVec,
const Point2x containerSizeX,
std::vector<Similarity2x> &trVec,
Point2x &coveredContainer)
{
trVec.clear();
trVec.resize(polyVec.size());
std::vector<Box2x> bbVec;
std::vector<float> rotVec;
for(size_t i=0;i<polyVec.size();++i)
{
float rot;
bbVec.push_back(getPolyOOBB(polyVec[i],rot));
rotVec.push_back(rot);
}
bool ret= RectPacker<float>::Pack(bbVec,containerSizeX,trVec,coveredContainer);
for(size_t i=0;i<polyVec.size();++i)
{
trVec[i].rotRad=rotVec[i];
}
return ret;
}
}; // end class
} // end namespace vcg
#endif // POLY_PACKER_H
|
