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
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
|
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2008 by Sun Microsystems, Inc.
*
* Portions Copright 2011 Thorsten Behrens <tbehrens@novell.com>
*
* OpenOffice.org - a multi-platform office productivity suite
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org 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 Lesser General Public License version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
// MARKER(update_precomp.py): autogen include statement, do not remove
#include "precompiled_basegfx.hxx"
#include <com/sun/star/drawing/PolyPolygonBezierCoords.hpp>
#include <com/sun/star/drawing/PointSequence.hpp>
#include <com/sun/star/drawing/FlagSequence.hpp>
#include <basegfx/polygon/b2dpolypolygontools.hxx>
#include <basegfx/polygon/b2dpolygontools.hxx>
#include <basegfx/polygon/b2dpolygon.hxx>
#include <basegfx/curve/b2dcubicbezier.hxx>
#include <basegfx/tools/unotools.hxx>
#include <comphelper/sequence.hxx>
using namespace ::com::sun::star;
namespace basegfx
{
namespace unotools
{
B2DPolyPolygon polyPolygonBezierToB2DPolyPolygon(const drawing::PolyPolygonBezierCoords& rSourcePolyPolygon)
throw( lang::IllegalArgumentException )
{
const sal_Int32 nOuterSequenceCount(rSourcePolyPolygon.Coordinates.getLength());
B2DPolyPolygon aNewPolyPolygon;
if(rSourcePolyPolygon.Flags.getLength() != nOuterSequenceCount)
throw lang::IllegalArgumentException();
// get pointers to inner sequence
const drawing::PointSequence* pInnerSequence = rSourcePolyPolygon.Coordinates.getConstArray();
const drawing::FlagSequence* pInnerSequenceFlags = rSourcePolyPolygon.Flags.getConstArray();
for(sal_Int32 a(0); a < nOuterSequenceCount; a++)
{
const sal_Int32 nInnerSequenceCount(pInnerSequence->getLength());
if(pInnerSequenceFlags->getLength() != nInnerSequenceCount)
throw lang::IllegalArgumentException();
// prepare new polygon
basegfx::B2DPolygon aNewPolygon;
const awt::Point* pArray = pInnerSequence->getConstArray();
const drawing::PolygonFlags* pArrayFlags = pInnerSequenceFlags->getConstArray();
// get first point and flag
basegfx::B2DPoint aNewCoordinatePair(pArray->X, pArray->Y); pArray++;
drawing::PolygonFlags ePolyFlag(*pArrayFlags); pArrayFlags++;
basegfx::B2DPoint aControlA;
basegfx::B2DPoint aControlB;
// first point is not allowed to be a control point
if(drawing::PolygonFlags_CONTROL == ePolyFlag)
throw lang::IllegalArgumentException();
// add first point as start point
aNewPolygon.append(aNewCoordinatePair);
for(sal_Int32 b(1); b < nInnerSequenceCount;)
{
// prepare loop
bool bControlA(false);
bool bControlB(false);
// get next point and flag
aNewCoordinatePair = basegfx::B2DPoint(pArray->X, pArray->Y);
ePolyFlag = *pArrayFlags;
pArray++; pArrayFlags++; b++;
if(b < nInnerSequenceCount && drawing::PolygonFlags_CONTROL == ePolyFlag)
{
aControlA = aNewCoordinatePair;
bControlA = true;
// get next point and flag
aNewCoordinatePair = basegfx::B2DPoint(pArray->X, pArray->Y);
ePolyFlag = *pArrayFlags;
pArray++; pArrayFlags++; b++;
}
if(b < nInnerSequenceCount && drawing::PolygonFlags_CONTROL == ePolyFlag)
{
aControlB = aNewCoordinatePair;
bControlB = true;
// get next point and flag
aNewCoordinatePair = basegfx::B2DPoint(pArray->X, pArray->Y);
ePolyFlag = *pArrayFlags;
pArray++; pArrayFlags++; b++;
}
// two or no control points are consumed, another one would be an error.
// It's also an error if only one control point was read
if(drawing::PolygonFlags_CONTROL == ePolyFlag || bControlA != bControlB)
throw lang::IllegalArgumentException();
// the previous writes used the B2DPolyPoygon -> PolyPolygon converter
// which did not create minimal PolyPolygons, but created all control points
// as null vectors (identical points). Because of the former P(CA)(CB)-norm of
// B2DPolygon and it's unused sign of being the zero-vector and CA and CB being
// relative to P, an empty edge was exported as P == CA == CB. Luckily, the new
// export format can be read without errors by the old OOo-versions, so we need only
// to correct here at read and do not need to export a wrong but compatible version
// for the future.
if(bControlA
&& aControlA.equal(aControlB)
&& aControlA.equal(aNewPolygon.getB2DPoint(aNewPolygon.count() - 1)))
{
bControlA = bControlB = false;
}
if(bControlA)
{
// add bezier edge
aNewPolygon.appendBezierSegment(aControlA, aControlB, aNewCoordinatePair);
}
else
{
// add edge
aNewPolygon.append(aNewCoordinatePair);
}
}
// next sequence
pInnerSequence++;
pInnerSequenceFlags++;
// #i72807# API import uses old line start/end-equal definition for closed,
// so we need to correct this to closed state here
basegfx::tools::checkClosed(aNewPolygon);
// add new subpolygon
aNewPolyPolygon.append(aNewPolygon);
}
return aNewPolyPolygon;
}
/////////////////////////////////////////////////////////////////////////////////
void b2DPolyPolygonToPolyPolygonBezier( const basegfx::B2DPolyPolygon& rPolyPoly,
drawing::PolyPolygonBezierCoords& rRetval )
{
rRetval.Coordinates.realloc(rPolyPoly.count());
rRetval.Flags.realloc(rPolyPoly.count());
drawing::PointSequence* pOuterSequence = rRetval.Coordinates.getArray();
drawing::FlagSequence* pOuterFlags = rRetval.Flags.getArray();
for(sal_uInt32 a=0;a<rPolyPoly.count();a++)
{
const B2DPolygon& rPoly = rPolyPoly.getB2DPolygon(a);
sal_uInt32 nCount(rPoly.count());
const bool bClosed(rPoly.isClosed());
// calculate input vertex count
const sal_uInt32 nLoopCount(bClosed ? nCount : (nCount ? nCount - 1L : 0L ));
std::vector<awt::Point> aPoints; aPoints.reserve(nLoopCount);
std::vector<drawing::PolygonFlags> aFlags; aFlags.reserve(nLoopCount);
// prepare insert index and current point
basegfx::B2DCubicBezier aBezier;
aBezier.setStartPoint(rPoly.getB2DPoint(0));
for(sal_uInt32 b(0L); b<nLoopCount; b++)
{
// add current point (always) and remember StartPointIndex for evtl. later corrections
const awt::Point aStartPoint(fround(aBezier.getStartPoint().getX()),
fround(aBezier.getStartPoint().getY()));
const sal_uInt32 nStartPointIndex(aPoints.size());
aPoints.push_back(aStartPoint);
aFlags.push_back(drawing::PolygonFlags_NORMAL);
// prepare next segment
const sal_uInt32 nNextIndex((b + 1) % nCount);
aBezier.setEndPoint(rPoly.getB2DPoint(nNextIndex));
aBezier.setControlPointA(rPoly.getNextControlPoint(b));
aBezier.setControlPointB(rPoly.getPrevControlPoint(nNextIndex));
if(aBezier.isBezier())
{
// if one is used, add always two control points due to the old schema
aPoints.push_back( awt::Point(fround(aBezier.getControlPointA().getX()),
fround(aBezier.getControlPointA().getY())) );
aFlags.push_back(drawing::PolygonFlags_CONTROL);
aPoints.push_back( awt::Point(fround(aBezier.getControlPointB().getX()),
fround(aBezier.getControlPointB().getY())) );
aFlags.push_back(drawing::PolygonFlags_CONTROL);
}
// test continuity with previous control point to set flag value
if(aBezier.getControlPointA() != aBezier.getStartPoint() && (bClosed || b))
{
const basegfx::B2VectorContinuity eCont(rPoly.getContinuityInPoint(b));
if(basegfx::CONTINUITY_C1 == eCont)
{
aFlags[nStartPointIndex] = drawing::PolygonFlags_SMOOTH;
}
else if(basegfx::CONTINUITY_C2 == eCont)
{
aFlags[nStartPointIndex] = drawing::PolygonFlags_SYMMETRIC;
}
}
// prepare next polygon step
aBezier.setStartPoint(aBezier.getEndPoint());
}
if(bClosed)
{
// add first point again as closing point due to old definition
aPoints.push_back( aPoints[0] );
aFlags.push_back(drawing::PolygonFlags_NORMAL);
}
else
{
// add last point as closing point
const basegfx::B2DPoint aClosingPoint(rPoly.getB2DPoint(nCount - 1L));
const awt::Point aEnd(fround(aClosingPoint.getX()),
fround(aClosingPoint.getY()));
aPoints.push_back(aEnd);
aFlags.push_back(drawing::PolygonFlags_NORMAL);
}
*pOuterSequence++ = comphelper::containerToSequence(aPoints);
*pOuterFlags++ = comphelper::containerToSequence(aFlags);
}
}
}
}
|
