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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2000, 2010 Oracle and/or its affiliates.
*
* 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.
*
************************************************************************/
#include <osl/diagnose.h>
#include <rtl/instance.hxx>
#include <basegfx/matrix/b2dhommatrix.hxx>
#include <hommatrixtemplate.hxx>
#include <basegfx/tuple/b2dtuple.hxx>
#include <basegfx/vector/b2dvector.hxx>
#include <basegfx/matrix/b2dhommatrixtools.hxx>
///////////////////////////////////////////////////////////////////////////////
namespace basegfx
{
class Impl2DHomMatrix : public ::basegfx::internal::ImplHomMatrixTemplate< 3 >
{
};
namespace { struct IdentityMatrix : public rtl::Static< B2DHomMatrix::ImplType,
IdentityMatrix > {}; }
B2DHomMatrix::B2DHomMatrix() :
mpImpl( IdentityMatrix::get() ) // use common identity matrix
{
}
B2DHomMatrix::B2DHomMatrix(const B2DHomMatrix& rMat) :
mpImpl(rMat.mpImpl)
{
}
B2DHomMatrix::~B2DHomMatrix()
{
}
B2DHomMatrix::B2DHomMatrix(double f_0x0, double f_0x1, double f_0x2, double f_1x0, double f_1x1, double f_1x2)
: mpImpl( IdentityMatrix::get() ) // use common identity matrix, will be made unique with 1st set-call
{
mpImpl->set(0, 0, f_0x0);
mpImpl->set(0, 1, f_0x1);
mpImpl->set(0, 2, f_0x2);
mpImpl->set(1, 0, f_1x0);
mpImpl->set(1, 1, f_1x1);
mpImpl->set(1, 2, f_1x2);
}
B2DHomMatrix& B2DHomMatrix::operator=(const B2DHomMatrix& rMat)
{
mpImpl = rMat.mpImpl;
return *this;
}
void B2DHomMatrix::makeUnique()
{
mpImpl.make_unique();
}
double B2DHomMatrix::get(sal_uInt16 nRow, sal_uInt16 nColumn) const
{
return mpImpl->get(nRow, nColumn);
}
void B2DHomMatrix::set(sal_uInt16 nRow, sal_uInt16 nColumn, double fValue)
{
mpImpl->set(nRow, nColumn, fValue);
}
void B2DHomMatrix::set3x2(double f_0x0, double f_0x1, double f_0x2, double f_1x0, double f_1x1, double f_1x2)
{
mpImpl->set(0, 0, f_0x0);
mpImpl->set(0, 1, f_0x1);
mpImpl->set(0, 2, f_0x2);
mpImpl->set(1, 0, f_1x0);
mpImpl->set(1, 1, f_1x1);
mpImpl->set(1, 2, f_1x2);
}
bool B2DHomMatrix::isLastLineDefault() const
{
return mpImpl->isLastLineDefault();
}
bool B2DHomMatrix::isIdentity() const
{
if(mpImpl.same_object(IdentityMatrix::get()))
return true;
return mpImpl->isIdentity();
}
void B2DHomMatrix::identity()
{
mpImpl = IdentityMatrix::get();
}
bool B2DHomMatrix::isInvertible() const
{
return mpImpl->isInvertible();
}
bool B2DHomMatrix::invert()
{
Impl2DHomMatrix aWork(*mpImpl);
sal_uInt16* pIndex = new sal_uInt16[mpImpl->getEdgeLength()];
sal_Int16 nParity;
if(aWork.ludcmp(pIndex, nParity))
{
mpImpl->doInvert(aWork, pIndex);
delete[] pIndex;
return true;
}
delete[] pIndex;
return false;
}
bool B2DHomMatrix::isNormalized() const
{
return mpImpl->isNormalized();
}
void B2DHomMatrix::normalize()
{
if(!const_cast<const B2DHomMatrix*>(this)->mpImpl->isNormalized())
mpImpl->doNormalize();
}
double B2DHomMatrix::determinant() const
{
return mpImpl->doDeterminant();
}
double B2DHomMatrix::trace() const
{
return mpImpl->doTrace();
}
void B2DHomMatrix::transpose()
{
mpImpl->doTranspose();
}
B2DHomMatrix& B2DHomMatrix::operator+=(const B2DHomMatrix& rMat)
{
mpImpl->doAddMatrix(*rMat.mpImpl);
return *this;
}
B2DHomMatrix& B2DHomMatrix::operator-=(const B2DHomMatrix& rMat)
{
mpImpl->doSubMatrix(*rMat.mpImpl);
return *this;
}
B2DHomMatrix& B2DHomMatrix::operator*=(double fValue)
{
const double fOne(1.0);
if(!fTools::equal(fOne, fValue))
mpImpl->doMulMatrix(fValue);
return *this;
}
B2DHomMatrix& B2DHomMatrix::operator/=(double fValue)
{
const double fOne(1.0);
if(!fTools::equal(fOne, fValue))
mpImpl->doMulMatrix(1.0 / fValue);
return *this;
}
B2DHomMatrix& B2DHomMatrix::operator*=(const B2DHomMatrix& rMat)
{
if(!rMat.isIdentity())
mpImpl->doMulMatrix(*rMat.mpImpl);
return *this;
}
bool B2DHomMatrix::operator==(const B2DHomMatrix& rMat) const
{
if(mpImpl.same_object(rMat.mpImpl))
return true;
return mpImpl->isEqual(*rMat.mpImpl);
}
bool B2DHomMatrix::operator!=(const B2DHomMatrix& rMat) const
{
return !(*this == rMat);
}
void B2DHomMatrix::rotate(double fRadiant)
{
if(!fTools::equalZero(fRadiant))
{
double fSin(0.0);
double fCos(1.0);
tools::createSinCosOrthogonal(fSin, fCos, fRadiant);
Impl2DHomMatrix aRotMat;
aRotMat.set(0, 0, fCos);
aRotMat.set(1, 1, fCos);
aRotMat.set(1, 0, fSin);
aRotMat.set(0, 1, -fSin);
mpImpl->doMulMatrix(aRotMat);
}
}
void B2DHomMatrix::translate(double fX, double fY)
{
if(!fTools::equalZero(fX) || !fTools::equalZero(fY))
{
Impl2DHomMatrix aTransMat;
aTransMat.set(0, 2, fX);
aTransMat.set(1, 2, fY);
mpImpl->doMulMatrix(aTransMat);
}
}
void B2DHomMatrix::scale(double fX, double fY)
{
const double fOne(1.0);
if(!fTools::equal(fOne, fX) || !fTools::equal(fOne, fY))
{
Impl2DHomMatrix aScaleMat;
aScaleMat.set(0, 0, fX);
aScaleMat.set(1, 1, fY);
mpImpl->doMulMatrix(aScaleMat);
}
}
void B2DHomMatrix::shearX(double fSx)
{
// #i76239# do not test againt 1.0, but against 0.0. We are talking about a value not on the diagonal (!)
if(!fTools::equalZero(fSx))
{
Impl2DHomMatrix aShearXMat;
aShearXMat.set(0, 1, fSx);
mpImpl->doMulMatrix(aShearXMat);
}
}
void B2DHomMatrix::shearY(double fSy)
{
// #i76239# do not test againt 1.0, but against 0.0. We are talking about a value not on the diagonal (!)
if(!fTools::equalZero(fSy))
{
Impl2DHomMatrix aShearYMat;
aShearYMat.set(1, 0, fSy);
mpImpl->doMulMatrix(aShearYMat);
}
}
/** Decomposition
New, optimized version with local shearX detection. Old version (keeping
below, is working well, too) used the 3D matrix decomposition when
shear was used. Keeping old version as comment below since it may get
necessary to add the determinant() test from there here, too.
*/
bool B2DHomMatrix::decompose(B2DTuple& rScale, B2DTuple& rTranslate, double& rRotate, double& rShearX) const
{
// when perspective is used, decompose is not made here
if(!mpImpl->isLastLineDefault())
{
return false;
}
// reset rotate and shear and copy translation values in every case
rRotate = rShearX = 0.0;
rTranslate.setX(get(0, 2));
rTranslate.setY(get(1, 2));
// test for rotation and shear
if(fTools::equalZero(get(0, 1)) && fTools::equalZero(get(1, 0)))
{
// no rotation and shear, copy scale values
rScale.setX(get(0, 0));
rScale.setY(get(1, 1));
}
else
{
// get the unit vectors of the transformation -> the perpendicular vectors
B2DVector aUnitVecX(get(0, 0), get(1, 0));
B2DVector aUnitVecY(get(0, 1), get(1, 1));
const double fScalarXY(aUnitVecX.scalar(aUnitVecY));
// Test if shear is zero. That's the case if the unit vectors in the matrix
// are perpendicular -> scalar is zero. This is also the case when one of
// the unit vectors is zero.
if(fTools::equalZero(fScalarXY))
{
// calculate unsigned scale values
rScale.setX(aUnitVecX.getLength());
rScale.setY(aUnitVecY.getLength());
// check unit vectors for zero lengths
const bool bXIsZero(fTools::equalZero(rScale.getX()));
const bool bYIsZero(fTools::equalZero(rScale.getY()));
if(bXIsZero || bYIsZero)
{
// still extract as much as possible. Scalings are already set
if(!bXIsZero)
{
// get rotation of X-Axis
rRotate = atan2(aUnitVecX.getY(), aUnitVecX.getX());
}
else if(!bYIsZero)
{
// get rotation of X-Axis. When assuming X and Y perpendicular
// and correct rotation, it's the Y-Axis rotation minus 90 degrees
rRotate = atan2(aUnitVecY.getY(), aUnitVecY.getX()) - M_PI_2;
}
// one or both unit vectors do not extist, determinant is zero, no decomposition possible.
// Eventually used rotations or shears are lost
return false;
}
else
{
// no shear
// calculate rotation of X unit vector relative to (1, 0)
rRotate = atan2(aUnitVecX.getY(), aUnitVecX.getX());
// use orientation to evtl. correct sign of Y-Scale
const double fCrossXY(aUnitVecX.cross(aUnitVecY));
if(fCrossXY < 0.0)
{
rScale.setY(-rScale.getY());
}
}
}
else
{
// fScalarXY is not zero, thus both unit vectors exist. No need to handle that here
// shear, extract it
double fCrossXY(aUnitVecX.cross(aUnitVecY));
// get rotation by calculating angle of X unit vector relative to (1, 0).
// This is before the parallell test following the motto to extract
// as much as possible
rRotate = atan2(aUnitVecX.getY(), aUnitVecX.getX());
// get unsigned scale value for X. It will not change and is useful
// for further corrections
rScale.setX(aUnitVecX.getLength());
if(fTools::equalZero(fCrossXY))
{
// extract as much as possible
rScale.setY(aUnitVecY.getLength());
// unit vectors are parallel, thus not linear independent. No
// useful decomposition possible. This should not happen since
// the only way to get the unit vectors nearly parallell is
// a very big shearing. Anyways, be prepared for hand-filled
// matrices
// Eventually used rotations or shears are lost
return false;
}
else
{
// calculate the contained shear
rShearX = fScalarXY / fCrossXY;
if(!fTools::equalZero(rRotate))
{
// To be able to correct the shear for aUnitVecY, rotation needs to be
// removed first. Correction of aUnitVecX is easy, it will be rotated back to (1, 0).
aUnitVecX.setX(rScale.getX());
aUnitVecX.setY(0.0);
// for Y correction we rotate the UnitVecY back about -rRotate
const double fNegRotate(-rRotate);
const double fSin(sin(fNegRotate));
const double fCos(cos(fNegRotate));
const double fNewX(aUnitVecY.getX() * fCos - aUnitVecY.getY() * fSin);
const double fNewY(aUnitVecY.getX() * fSin + aUnitVecY.getY() * fCos);
aUnitVecY.setX(fNewX);
aUnitVecY.setY(fNewY);
}
// Correct aUnitVecY and fCrossXY to fShear=0. Rotation is already removed.
// Shear correction can only work with removed rotation
aUnitVecY.setX(aUnitVecY.getX() - (aUnitVecY.getY() * rShearX));
fCrossXY = aUnitVecX.cross(aUnitVecY);
// calculate unsigned scale value for Y, after the corrections since
// the shear correction WILL change the length of aUnitVecY
rScale.setY(aUnitVecY.getLength());
// use orientation to set sign of Y-Scale
if(fCrossXY < 0.0)
{
rScale.setY(-rScale.getY());
}
}
}
}
return true;
}
} // end of namespace basegfx
///////////////////////////////////////////////////////////////////////////////
// eof
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|