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
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474 | /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#include <com/sun/star/geometry/RealSize2D.hpp>
#include <com/sun/star/geometry/RealPoint2D.hpp>
#include <com/sun/star/geometry/RealRectangle2D.hpp>
#include <com/sun/star/geometry/RealRectangle3D.hpp>
#include <com/sun/star/geometry/RealBezierSegment2D.hpp>
#include <com/sun/star/geometry/AffineMatrix2D.hpp>
#include <com/sun/star/geometry/AffineMatrix3D.hpp>
#include <com/sun/star/geometry/IntegerSize2D.hpp>
#include <com/sun/star/geometry/IntegerRectangle2D.hpp>
#include <com/sun/star/lang/IllegalArgumentException.hpp>
#include <com/sun/star/rendering/XPolyPolygon2D.hpp>
#include <com/sun/star/rendering/XGraphicDevice.hpp>
#include <com/sun/star/awt/Rectangle.hpp>
#include <basegfx/utils/unopolypolygon.hxx>
#include <basegfx/matrix/b2dhommatrix.hxx>
#include <basegfx/matrix/b3dhommatrix.hxx>
#include <basegfx/point/b2dpoint.hxx>
#include <basegfx/range/b3drange.hxx>
#include <basegfx/range/b2irange.hxx>
#include <basegfx/polygon/b2dpolygon.hxx>
#include <basegfx/polygon/b2dpolypolygon.hxx>
#include <basegfx/utils/canvastools.hxx>
using namespace ::com::sun::star;
namespace basegfx::unotools
{
namespace
{
uno::Sequence< geometry::RealBezierSegment2D > bezierSequenceFromB2DPolygon(const ::basegfx::B2DPolygon& rPoly)
{
const sal_uInt32 nPointCount(rPoly.count());
uno::Sequence< geometry::RealBezierSegment2D > outputSequence(nPointCount);
geometry::RealBezierSegment2D* pOutput = outputSequence.getArray();
// fill sequences and imply closed polygon on this implementation layer
for(sal_uInt32 a(0); a < nPointCount; a++)
{
const basegfx::B2DPoint aStart(rPoly.getB2DPoint(a));
const basegfx::B2DPoint aControlA(rPoly.getNextControlPoint(a));
const basegfx::B2DPoint aControlB(rPoly.getPrevControlPoint((a + 1) % nPointCount));
pOutput[a] = geometry::RealBezierSegment2D(
aStart.getX(), aStart.getY(),
aControlA.getX(), aControlA.getY(),
aControlB.getX(), aControlB.getY());
}
return outputSequence;
}
uno::Sequence< geometry::RealPoint2D > pointSequenceFromB2DPolygon( const ::basegfx::B2DPolygon& rPoly )
{
const sal_uInt32 nNumPoints( rPoly.count() );
uno::Sequence< geometry::RealPoint2D > outputSequence( nNumPoints );
geometry::RealPoint2D* pOutput = outputSequence.getArray();
// fill sequence from polygon
sal_uInt32 i;
for( i=0; i<nNumPoints; ++i )
{
const ::basegfx::B2DPoint aPoint( rPoly.getB2DPoint(i) );
pOutput[i] = geometry::RealPoint2D( aPoint.getX(),
aPoint.getY() );
}
return outputSequence;
}
}
uno::Sequence< uno::Sequence< geometry::RealBezierSegment2D > > bezierSequenceSequenceFromB2DPolyPolygon( const ::basegfx::B2DPolyPolygon& rPolyPoly )
{
const sal_uInt32 nNumPolies( rPolyPoly.count() );
sal_uInt32 i;
uno::Sequence< uno::Sequence< geometry::RealBezierSegment2D > > outputSequence( nNumPolies );
uno::Sequence< geometry::RealBezierSegment2D >* pOutput = outputSequence.getArray();
for( i=0; i<nNumPolies; ++i )
{
pOutput[i] = bezierSequenceFromB2DPolygon( rPolyPoly.getB2DPolygon(i) );
}
return outputSequence;
}
uno::Sequence< uno::Sequence< geometry::RealPoint2D > > pointSequenceSequenceFromB2DPolyPolygon( const ::basegfx::B2DPolyPolygon& rPolyPoly )
{
const sal_uInt32 nNumPolies( rPolyPoly.count() );
sal_uInt32 i;
uno::Sequence< uno::Sequence< geometry::RealPoint2D > > outputSequence( nNumPolies );
uno::Sequence< geometry::RealPoint2D >* pOutput = outputSequence.getArray();
for( i=0; i<nNumPolies; ++i )
{
pOutput[i] = pointSequenceFromB2DPolygon( rPolyPoly.getB2DPolygon(i) );
}
return outputSequence;
}
uno::Reference< rendering::XPolyPolygon2D > xPolyPolygonFromB2DPolygon( const uno::Reference< rendering::XGraphicDevice >& xGraphicDevice,
const ::basegfx::B2DPolygon& rPoly )
{
uno::Reference< rendering::XPolyPolygon2D > xRes;
if( !xGraphicDevice.is() )
return xRes;
if( rPoly.areControlPointsUsed() )
{
uno::Sequence< uno::Sequence< geometry::RealBezierSegment2D > > outputSequence{ bezierSequenceFromB2DPolygon( rPoly )};
xRes = xGraphicDevice->createCompatibleBezierPolyPolygon( outputSequence );
}
else
{
uno::Sequence< uno::Sequence< geometry::RealPoint2D > > outputSequence{
pointSequenceFromB2DPolygon( rPoly )};
xRes = xGraphicDevice->createCompatibleLinePolyPolygon( outputSequence );
}
if( xRes.is() && rPoly.isClosed() )
xRes->setClosed( 0, true );
return xRes;
}
uno::Reference< rendering::XPolyPolygon2D > xPolyPolygonFromB2DPolyPolygon( const uno::Reference< rendering::XGraphicDevice >& xGraphicDevice,
const ::basegfx::B2DPolyPolygon& rPolyPoly )
{
uno::Reference< rendering::XPolyPolygon2D > xRes;
if( !xGraphicDevice.is() )
return xRes;
const sal_uInt32 nNumPolies( rPolyPoly.count() );
sal_uInt32 i;
if( rPolyPoly.areControlPointsUsed() )
{
xRes = xGraphicDevice->createCompatibleBezierPolyPolygon(
bezierSequenceSequenceFromB2DPolyPolygon( rPolyPoly ) );
}
else
{
xRes = xGraphicDevice->createCompatibleLinePolyPolygon(
pointSequenceSequenceFromB2DPolyPolygon( rPolyPoly ) );
}
for( i=0; i<nNumPolies; ++i )
{
xRes->setClosed( i, rPolyPoly.getB2DPolygon(i).isClosed() );
}
return xRes;
}
::basegfx::B2DPolygon polygonFromPoint2DSequence( const uno::Sequence< geometry::RealPoint2D >& points )
{
const sal_Int32 nCurrSize( points.getLength() );
::basegfx::B2DPolygon aPoly;
for( sal_Int32 nCurrPoint=0; nCurrPoint<nCurrSize; ++nCurrPoint )
aPoly.append( b2DPointFromRealPoint2D( points[nCurrPoint] ) );
return aPoly;
}
::basegfx::B2DPolyPolygon polyPolygonFromPoint2DSequenceSequence( const uno::Sequence< uno::Sequence< geometry::RealPoint2D > >& points )
{
::basegfx::B2DPolyPolygon aRes;
for( const auto & p : points )
{
aRes.append( polygonFromPoint2DSequence( p ) );
}
return aRes;
}
::basegfx::B2DPolygon polygonFromBezier2DSequence( const uno::Sequence< geometry::RealBezierSegment2D >& curves )
{
const sal_Int32 nSize(curves.getLength());
basegfx::B2DPolygon aRetval;
if(nSize)
{
// prepare start with providing a start point. Use the first point from
// the sequence for this
const geometry::RealBezierSegment2D& rFirstSegment(curves[0]); // #i79917# first segment, not last
aRetval.append(basegfx::B2DPoint(rFirstSegment.Px, rFirstSegment.Py));
for(sal_Int32 a(0); a < nSize; a++)
{
const geometry::RealBezierSegment2D& rCurrSegment(curves[a]);
const geometry::RealBezierSegment2D& rNextSegment(curves[(a + 1) % nSize]);
// append curved edge with the control points and the next point
aRetval.appendBezierSegment(
basegfx::B2DPoint(rCurrSegment.C1x, rCurrSegment.C1y),
basegfx::B2DPoint(rCurrSegment.C2x, rCurrSegment.C2y), // #i79917# Argh! An x for an y!!
basegfx::B2DPoint(rNextSegment.Px, rNextSegment.Py));
}
// rescue the control point and remove the now double-added point
aRetval.setPrevControlPoint(0, aRetval.getPrevControlPoint(aRetval.count() - 1));
aRetval.remove(aRetval.count() - 1);
}
return aRetval;
}
::basegfx::B2DPolyPolygon polyPolygonFromBezier2DSequenceSequence( const uno::Sequence< uno::Sequence< geometry::RealBezierSegment2D > >& curves )
{
::basegfx::B2DPolyPolygon aRes;
for( const auto & c : curves )
{
aRes.append( polygonFromBezier2DSequence( c ) );
}
return aRes;
}
::basegfx::B2DPolyPolygon b2DPolyPolygonFromXPolyPolygon2D( const uno::Reference< rendering::XPolyPolygon2D >& xPoly )
{
::basegfx::unotools::UnoPolyPolygon* pPolyImpl =
dynamic_cast< ::basegfx::unotools::UnoPolyPolygon* >( xPoly.get() );
if( pPolyImpl )
{
return pPolyImpl->getPolyPolygon();
}
else
{
// not a known implementation object - try data source
// interfaces
const sal_Int32 nPolys( xPoly->getNumberOfPolygons() );
uno::Reference< rendering::XBezierPolyPolygon2D > xBezierPoly(
xPoly,
uno::UNO_QUERY );
if( xBezierPoly.is() )
{
return ::basegfx::unotools::polyPolygonFromBezier2DSequenceSequence(
xBezierPoly->getBezierSegments( 0,
nPolys,
0,
-1 ) );
}
else
{
uno::Reference< rendering::XLinePolyPolygon2D > xLinePoly(
xPoly,
uno::UNO_QUERY );
// no implementation class and no data provider
// found - contract violation.
if( !xLinePoly.is() )
{
throw lang::IllegalArgumentException(
"basegfx::unotools::b2DPolyPolygonFromXPolyPolygon2D(): Invalid input"
"poly-polygon, cannot retrieve vertex data",
uno::Reference< uno::XInterface >(),
0 );
}
return ::basegfx::unotools::polyPolygonFromPoint2DSequenceSequence(
xLinePoly->getPoints( 0,
nPolys,
0,
-1 ));
}
}
}
::basegfx::B2DHomMatrix& homMatrixFromAffineMatrix( ::basegfx::B2DHomMatrix& output,
const geometry::AffineMatrix2D& input )
{
// ensure last row is [0,0,1] (and optimized away)
output.identity();
output.set(0,0, input.m00);
output.set(0,1, input.m01);
output.set(0,2, input.m02);
output.set(1,0, input.m10);
output.set(1,1, input.m11);
output.set(1,2, input.m12);
return output;
}
::basegfx::B3DHomMatrix homMatrixFromAffineMatrix3D( const ::css::geometry::AffineMatrix3D& input )
{
::basegfx::B3DHomMatrix output;
output.set(0,0, input.m00);
output.set(0,1, input.m01);
output.set(0,2, input.m02);
output.set(0,3, input.m03);
output.set(1,0, input.m10);
output.set(1,1, input.m11);
output.set(1,2, input.m12);
output.set(1,3, input.m13);
output.set(2,0, input.m20);
output.set(2,1, input.m21);
output.set(2,2, input.m22);
output.set(2,3, input.m23);
return output;
}
geometry::AffineMatrix2D& affineMatrixFromHomMatrix( geometry::AffineMatrix2D& output,
const ::basegfx::B2DHomMatrix& input)
{
output.m00 = input.get(0,0);
output.m01 = input.get(0,1);
output.m02 = input.get(0,2);
output.m10 = input.get(1,0);
output.m11 = input.get(1,1);
output.m12 = input.get(1,2);
return output;
}
geometry::AffineMatrix3D& affineMatrixFromHomMatrix3D(
geometry::AffineMatrix3D& output,
const ::basegfx::B3DHomMatrix& input)
{
output.m00 = input.get(0,0);
output.m01 = input.get(0,1);
output.m02 = input.get(0,2);
output.m03 = input.get(0,3);
output.m10 = input.get(1,0);
output.m11 = input.get(1,1);
output.m12 = input.get(1,2);
output.m13 = input.get(1,3);
output.m20 = input.get(2,0);
output.m21 = input.get(2,1);
output.m22 = input.get(2,2);
output.m23 = input.get(2,3);
return output;
}
geometry::RealSize2D size2DFromB2DSize( const ::basegfx::B2DVector& rVec )
{
return geometry::RealSize2D( rVec.getX(),
rVec.getY() );
}
geometry::RealPoint2D point2DFromB2DPoint( const ::basegfx::B2DPoint& rPoint )
{
return geometry::RealPoint2D( rPoint.getX(),
rPoint.getY() );
}
geometry::RealRectangle2D rectangle2DFromB2DRectangle( const ::basegfx::B2DRange& rRect )
{
return geometry::RealRectangle2D( rRect.getMinX(),
rRect.getMinY(),
rRect.getMaxX(),
rRect.getMaxY() );
}
geometry::RealRectangle3D rectangle3DFromB3DRectangle( const ::basegfx::B3DRange& rRect )
{
return geometry::RealRectangle3D( rRect.getMinX(),
rRect.getMinY(),
rRect.getMinZ(),
rRect.getMaxX(),
rRect.getMaxY(),
rRect.getMaxZ());
}
::basegfx::B2DPoint b2DPointFromRealPoint2D( const geometry::RealPoint2D& rPoint )
{
return ::basegfx::B2DPoint( rPoint.X,
rPoint.Y );
}
::basegfx::B2DRange b2DRectangleFromRealRectangle2D( const geometry::RealRectangle2D& rRect )
{
return ::basegfx::B2DRange( rRect.X1,
rRect.Y1,
rRect.X2,
rRect.Y2 );
}
::basegfx::B3DRange b3DRectangleFromRealRectangle3D( const geometry::RealRectangle3D& rRect )
{
return ::basegfx::B3DRange( rRect.X1,
rRect.Y1,
rRect.Z1,
rRect.X2,
rRect.Y2,
rRect.Z2);
}
geometry::IntegerSize2D integerSize2DFromB2ISize( const ::basegfx::B2IVector& rSize )
{
return geometry::IntegerSize2D( rSize.getX(),
rSize.getY() );
}
::basegfx::B2IVector b2ISizeFromIntegerSize2D( const geometry::IntegerSize2D& rSize )
{
return ::basegfx::B2IVector( rSize.Width,
rSize.Height );
}
::basegfx::B2IRange b2IRectangleFromIntegerRectangle2D( const geometry::IntegerRectangle2D& rRectangle )
{
return ::basegfx::B2IRange( rRectangle.X1, rRectangle.Y1,
rRectangle.X2, rRectangle.Y2 );
}
::basegfx::B2IRange b2IRectangleFromAwtRectangle( const awt::Rectangle& rRect )<--- The function 'b2IRectangleFromAwtRectangle' is never used.
{
return ::basegfx::B2IRange( rRect.X,
rRect.Y,
rRect.X + rRect.Width,
rRect.Y + rRect.Height );
}
::basegfx::B2IRange b2ISurroundingRangeFromB2DRange( const ::basegfx::B2DRange& rRange )
{
return ::basegfx::B2IRange( static_cast<sal_Int32>( floor(rRange.getMinX()) ),
static_cast<sal_Int32>( floor(rRange.getMinY()) ),
static_cast<sal_Int32>( ceil(rRange.getMaxX()) ),
static_cast<sal_Int32>( ceil(rRange.getMaxY()) ) );
}
::basegfx::B2DRange b2DSurroundingIntegerRangeFromB2DRange( const ::basegfx::B2DRange& rRange )
{
return ::basegfx::B2DRange( floor(rRange.getMinX()),
floor(rRange.getMinY()),
ceil(rRange.getMaxX()),
ceil(rRange.getMaxY()) );
}
} // namespace
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|