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
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
|
/* -*- 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 <basegfx/polygon/b2dpolypolygontools.hxx>
#include <osl/diagnose.h>
#include <basegfx/polygon/b2dpolypolygon.hxx>
#include <basegfx/polygon/b2dpolygon.hxx>
#include <basegfx/polygon/b2dpolygontools.hxx>
#include <basegfx/numeric/ftools.hxx>
#include <basegfx/polygon/b2dpolypolygoncutter.hxx>
#include <numeric>
//////////////////////////////////////////////////////////////////////////////
namespace basegfx
{
namespace tools
{
B2DPolyPolygon correctOrientations(const B2DPolyPolygon& rCandidate)
{
B2DPolyPolygon aRetval(rCandidate);
const sal_uInt32 nCount(aRetval.count());
for(sal_uInt32 a(0L); a < nCount; a++)
{
const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a));
const B2VectorOrientation aOrientation(tools::getOrientation(aCandidate));
sal_uInt32 nDepth(0L);
for(sal_uInt32 b(0L); b < nCount; b++)
{
if(b != a)
{
const B2DPolygon aCompare(rCandidate.getB2DPolygon(b));
if(tools::isInside(aCompare, aCandidate, true))
{
nDepth++;
}
}
}
const bool bShallBeHole(1L == (nDepth & 0x00000001));
const bool bIsHole(ORIENTATION_NEGATIVE == aOrientation);
if(bShallBeHole != bIsHole && ORIENTATION_NEUTRAL != aOrientation)
{
B2DPolygon aFlipped(aCandidate);
aFlipped.flip();
aRetval.setB2DPolygon(a, aFlipped);
}
}
return aRetval;
}
B2DPolyPolygon correctOutmostPolygon(const B2DPolyPolygon& rCandidate)
{
const sal_uInt32 nCount(rCandidate.count());
if(nCount > 1L)
{
for(sal_uInt32 a(0L); a < nCount; a++)
{
const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a));
sal_uInt32 nDepth(0L);
for(sal_uInt32 b(0L); b < nCount; b++)
{
if(b != a)
{
const B2DPolygon aCompare(rCandidate.getB2DPolygon(b));
if(tools::isInside(aCompare, aCandidate, true))
{
nDepth++;
}
}
}
if(!nDepth)
{
B2DPolyPolygon aRetval(rCandidate);
if(a != 0L)
{
// exchange polygon a and polygon 0L
aRetval.setB2DPolygon(0L, aCandidate);
aRetval.setB2DPolygon(a, rCandidate.getB2DPolygon(0L));
}
// exit
return aRetval;
}
}
}
return rCandidate;
}
B2DPolyPolygon adaptiveSubdivideByDistance(const B2DPolyPolygon& rCandidate, double fDistanceBound)
{
if(rCandidate.areControlPointsUsed())
{
const sal_uInt32 nPolygonCount(rCandidate.count());
B2DPolyPolygon aRetval;
for(sal_uInt32 a(0L); a < nPolygonCount; a++)
{
const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a));
if(aCandidate.areControlPointsUsed())
{
aRetval.append(tools::adaptiveSubdivideByDistance(aCandidate, fDistanceBound));
}
else
{
aRetval.append(aCandidate);
}
}
return aRetval;
}
else
{
return rCandidate;
}
}
B2DPolyPolygon adaptiveSubdivideByAngle(const B2DPolyPolygon& rCandidate, double fAngleBound)
{
if(rCandidate.areControlPointsUsed())
{
const sal_uInt32 nPolygonCount(rCandidate.count());
B2DPolyPolygon aRetval;
for(sal_uInt32 a(0L); a < nPolygonCount; a++)
{
const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a));
if(aCandidate.areControlPointsUsed())
{
aRetval.append(tools::adaptiveSubdivideByAngle(aCandidate, fAngleBound));
}
else
{
aRetval.append(aCandidate);
}
}
return aRetval;
}
else
{
return rCandidate;
}
}
B2DPolyPolygon adaptiveSubdivideByCount(const B2DPolyPolygon& rCandidate, sal_uInt32 nCount)
{
if(rCandidate.areControlPointsUsed())
{
const sal_uInt32 nPolygonCount(rCandidate.count());
B2DPolyPolygon aRetval;
for(sal_uInt32 a(0L); a < nPolygonCount; a++)
{
const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a));
if(aCandidate.areControlPointsUsed())
{
aRetval.append(tools::adaptiveSubdivideByCount(aCandidate, nCount));
}
else
{
aRetval.append(aCandidate);
}
}
return aRetval;
}
else
{
return rCandidate;
}
}
bool isInside(const B2DPolyPolygon& rCandidate, const B2DPoint& rPoint, bool bWithBorder)
{
const sal_uInt32 nPolygonCount(rCandidate.count());
if(1L == nPolygonCount)
{
return isInside(rCandidate.getB2DPolygon(0L), rPoint, bWithBorder);
}
else
{
sal_Int32 nInsideCount(0L);
for(sal_uInt32 a(0L); a < nPolygonCount; a++)
{
const B2DPolygon aPolygon(rCandidate.getB2DPolygon(a));
const bool bInside(isInside(aPolygon, rPoint, bWithBorder));
if(bInside)
{
nInsideCount++;
}
}
return (nInsideCount % 2L);
}
}
B2DRange getRangeWithControlPoints(const B2DPolyPolygon& rCandidate)
{
B2DRange aRetval;
const sal_uInt32 nPolygonCount(rCandidate.count());
for(sal_uInt32 a(0L); a < nPolygonCount; a++)
{
B2DPolygon aCandidate = rCandidate.getB2DPolygon(a);
aRetval.expand(tools::getRangeWithControlPoints(aCandidate));
}
return aRetval;
}
B2DRange getRange(const B2DPolyPolygon& rCandidate)
{
B2DRange aRetval;
const sal_uInt32 nPolygonCount(rCandidate.count());
for(sal_uInt32 a(0L); a < nPolygonCount; a++)
{
B2DPolygon aCandidate = rCandidate.getB2DPolygon(a);
aRetval.expand(tools::getRange(aCandidate));
}
return aRetval;
}
void applyLineDashing(const B2DPolyPolygon& rCandidate, const ::std::vector<double>& rDotDashArray, B2DPolyPolygon* pLineTarget, B2DPolyPolygon* pGapTarget, double fFullDashDotLen)
{
if(0.0 == fFullDashDotLen && rDotDashArray.size())
{
// calculate fFullDashDotLen from rDotDashArray
fFullDashDotLen = ::std::accumulate(rDotDashArray.begin(), rDotDashArray.end(), 0.0);
}
if(rCandidate.count() && fFullDashDotLen > 0.0)
{
B2DPolyPolygon aLineTarget, aGapTarget;
for(sal_uInt32 a(0L); a < rCandidate.count(); a++)
{
const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a));
applyLineDashing(
aCandidate,
rDotDashArray,
pLineTarget ? &aLineTarget : 0,
pGapTarget ? &aGapTarget : 0,
fFullDashDotLen);
if(pLineTarget)
{
pLineTarget->append(aLineTarget);
}
if(pGapTarget)
{
pGapTarget->append(aGapTarget);
}
}
}
}
bool isInEpsilonRange(const B2DPolyPolygon& rCandidate, const B2DPoint& rTestPosition, double fDistance)
{
const sal_uInt32 nPolygonCount(rCandidate.count());
for(sal_uInt32 a(0L); a < nPolygonCount; a++)
{
B2DPolygon aCandidate(rCandidate.getB2DPolygon(a));
if(isInEpsilonRange(aCandidate, rTestPosition, fDistance))
{
return true;
}
}
return false;
}
B3DPolyPolygon createB3DPolyPolygonFromB2DPolyPolygon(const B2DPolyPolygon& rCandidate, double fZCoordinate)
{
const sal_uInt32 nPolygonCount(rCandidate.count());
B3DPolyPolygon aRetval;
for(sal_uInt32 a(0L); a < nPolygonCount; a++)
{
B2DPolygon aCandidate(rCandidate.getB2DPolygon(a));
aRetval.append(createB3DPolygonFromB2DPolygon(aCandidate, fZCoordinate));
}
return aRetval;
}
B2DPolyPolygon createB2DPolyPolygonFromB3DPolyPolygon(const B3DPolyPolygon& rCandidate, const B3DHomMatrix& rMat)
{
const sal_uInt32 nPolygonCount(rCandidate.count());
B2DPolyPolygon aRetval;
for(sal_uInt32 a(0L); a < nPolygonCount; a++)
{
B3DPolygon aCandidate(rCandidate.getB3DPolygon(a));
aRetval.append(createB2DPolygonFromB3DPolygon(aCandidate, rMat));
}
return aRetval;
}
double getSmallestDistancePointToPolyPolygon(const B2DPolyPolygon& rCandidate, const B2DPoint& rTestPoint, sal_uInt32& rPolygonIndex, sal_uInt32& rEdgeIndex, double& rCut)
{
double fRetval(DBL_MAX);
const double fZero(0.0);
const sal_uInt32 nPolygonCount(rCandidate.count());
for(sal_uInt32 a(0L); a < nPolygonCount; a++)
{
const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a));
sal_uInt32 nNewEdgeIndex;
double fNewCut;
const double fNewDistance(getSmallestDistancePointToPolygon(aCandidate, rTestPoint, nNewEdgeIndex, fNewCut));
if(DBL_MAX == fRetval || fNewDistance < fRetval)
{
fRetval = fNewDistance;
rPolygonIndex = a;
rEdgeIndex = nNewEdgeIndex;
rCut = fNewCut;
if(fTools::equal(fRetval, fZero))
{
// already found zero distance, cannot get better. Ensure numerical zero value and end loop.
fRetval = 0.0;
break;
}
}
}
return fRetval;
}
B2DPolyPolygon distort(const B2DPolyPolygon& rCandidate, const B2DRange& rOriginal, const B2DPoint& rTopLeft, const B2DPoint& rTopRight, const B2DPoint& rBottomLeft, const B2DPoint& rBottomRight)
{
const sal_uInt32 nPolygonCount(rCandidate.count());
B2DPolyPolygon aRetval;
for(sal_uInt32 a(0L); a < nPolygonCount; a++)
{
const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a));
aRetval.append(distort(aCandidate, rOriginal, rTopLeft, rTopRight, rBottomLeft, rBottomRight));
}
return aRetval;
}
B2DPolyPolygon rotateAroundPoint(const B2DPolyPolygon& rCandidate, const B2DPoint& rCenter, double fAngle)
{
const sal_uInt32 nPolygonCount(rCandidate.count());
B2DPolyPolygon aRetval;
for(sal_uInt32 a(0L); a < nPolygonCount; a++)
{
const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a));
aRetval.append(rotateAroundPoint(aCandidate, rCenter, fAngle));
}
return aRetval;
}
B2DPolyPolygon expandToCurve(const B2DPolyPolygon& rCandidate)
{
const sal_uInt32 nPolygonCount(rCandidate.count());
B2DPolyPolygon aRetval;
for(sal_uInt32 a(0L); a < nPolygonCount; a++)
{
const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a));
aRetval.append(expandToCurve(aCandidate));
}
return aRetval;
}
B2DPolyPolygon setContinuity(const B2DPolyPolygon& rCandidate, B2VectorContinuity eContinuity)
{
if(rCandidate.areControlPointsUsed())
{
const sal_uInt32 nPolygonCount(rCandidate.count());
B2DPolyPolygon aRetval;
for(sal_uInt32 a(0L); a < nPolygonCount; a++)
{
const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a));
aRetval.append(setContinuity(aCandidate, eContinuity));
}
return aRetval;
}
else
{
return rCandidate;
}
}
B2DPolyPolygon growInNormalDirection(const B2DPolyPolygon& rCandidate, double fValue)
{
if(0.0 != fValue)
{
B2DPolyPolygon aRetval;
for(sal_uInt32 a(0L); a < rCandidate.count(); a++)
{
aRetval.append(growInNormalDirection(rCandidate.getB2DPolygon(a), fValue));
}
return aRetval;
}
else
{
return rCandidate;
}
}
void correctGrowShrinkPolygonPair(B2DPolyPolygon& /*rOriginal*/, B2DPolyPolygon& /*rGrown*/)
{
}
B2DPolyPolygon reSegmentPolyPolygon(const B2DPolyPolygon& rCandidate, sal_uInt32 nSegments)
{
B2DPolyPolygon aRetval;
for(sal_uInt32 a(0L); a < rCandidate.count(); a++)
{
aRetval.append(reSegmentPolygon(rCandidate.getB2DPolygon(a), nSegments));
}
return aRetval;
}
B2DPolyPolygon interpolate(const B2DPolyPolygon& rOld1, const B2DPolyPolygon& rOld2, double t)
{
OSL_ENSURE(rOld1.count() == rOld2.count(), "B2DPolyPolygon interpolate: Different geometry (!)");
B2DPolyPolygon aRetval;
for(sal_uInt32 a(0L); a < rOld1.count(); a++)
{
aRetval.append(interpolate(rOld1.getB2DPolygon(a), rOld2.getB2DPolygon(a), t));
}
return aRetval;
}
bool isRectangle( const B2DPolyPolygon& rPoly )
{
// exclude some cheap cases first
if( rPoly.count() != 1 )
return false;
return isRectangle( rPoly.getB2DPolygon(0) );
}
// #i76891#
B2DPolyPolygon simplifyCurveSegments(const B2DPolyPolygon& rCandidate)
{
if(rCandidate.areControlPointsUsed())
{
B2DPolyPolygon aRetval;
for(sal_uInt32 a(0L); a < rCandidate.count(); a++)
{
aRetval.append(simplifyCurveSegments(rCandidate.getB2DPolygon(a)));
}
return aRetval;
}
else
{
return rCandidate;
}
}
B2DPolyPolygon reSegmentPolyPolygonEdges(const B2DPolyPolygon& rCandidate, sal_uInt32 nSubEdges, bool bHandleCurvedEdges, bool bHandleStraightEdges)
{
B2DPolyPolygon aRetval;
for(sal_uInt32 a(0L); a < rCandidate.count(); a++)
{
aRetval.append(reSegmentPolygonEdges(rCandidate.getB2DPolygon(a), nSubEdges, bHandleCurvedEdges, bHandleStraightEdges));
}
return aRetval;
}
//////////////////////////////////////////////////////////////////////
// comparators with tolerance for 2D PolyPolygons
bool equal(const B2DPolyPolygon& rCandidateA, const B2DPolyPolygon& rCandidateB, const double& rfSmallValue)
{
const sal_uInt32 nPolygonCount(rCandidateA.count());
if(nPolygonCount != rCandidateB.count())
return false;
for(sal_uInt32 a(0); a < nPolygonCount; a++)
{
const B2DPolygon aCandidate(rCandidateA.getB2DPolygon(a));
if(!equal(aCandidate, rCandidateB.getB2DPolygon(a), rfSmallValue))
return false;
}
return true;
}
bool equal(const B2DPolyPolygon& rCandidateA, const B2DPolyPolygon& rCandidateB)
{
const double fSmallValue(fTools::getSmallValue());
return equal(rCandidateA, rCandidateB, fSmallValue);
}
B2DPolyPolygon snapPointsOfHorizontalOrVerticalEdges(const B2DPolyPolygon& rCandidate)
{
B2DPolyPolygon aRetval;
for(sal_uInt32 a(0L); a < rCandidate.count(); a++)
{
aRetval.append(snapPointsOfHorizontalOrVerticalEdges(rCandidate.getB2DPolygon(a)));
}
return aRetval;
}
} // end of namespace tools
} // end of namespace basegfx
//////////////////////////////////////////////////////////////////////////////
// eof
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
