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
|
/* -*- 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 "sal/config.h"
#include "sal/precppunit.hxx"
// autogenerated file with codegen.pl
#include "cppunit/TestAssert.h"
#include "cppunit/TestFixture.h"
#include "cppunit/extensions/HelperMacros.h"
#include <basegfx/matrix/b2dhommatrix.hxx>
#include <basegfx/curve/b2dcubicbezier.hxx>
#include <basegfx/curve/b2dbeziertools.hxx>
#include <basegfx/range/b2dpolyrange.hxx>
#include <basegfx/polygon/b2dpolygon.hxx>
#include <basegfx/polygon/b2dpolygontools.hxx>
#include <basegfx/polygon/b2dpolypolygontools.hxx>
#include <basegfx/polygon/b2dpolypolygoncutter.hxx>
#include <basegfx/polygon/b2dpolygonclipper.hxx>
#include <basegfx/polygon/b2dpolypolygon.hxx>
#include <basegfx/numeric/ftools.hxx>
#include <boost/bind.hpp>
using namespace ::basegfx;
namespace basegfx2d
{
/// Gets a random ordinal [0,n)
inline double getRandomOrdinal( const ::std::size_t n )
{
// use this one when displaying polygons in OOo, which still sucks
// great rocks when trying to import non-integer svg:d attributes
// return sal_Int64(double(n) * rand() / (RAND_MAX + 1.0));
return double(n) * rand() / (RAND_MAX + 1.0);
}
inline bool compare(const B2DPoint& left, const B2DPoint& right)
{
return left.getX()<right.getX()
|| (left.getX()==right.getX() && left.getY()<right.getY());
}
class boxclipper : public CppUnit::TestFixture
{
private:
B2DPolyRange aDisjunctRanges;
B2DPolyRange aEqualRanges;
B2DPolyRange aIntersectionN;
B2DPolyRange aIntersectionE;
B2DPolyRange aIntersectionS;
B2DPolyRange aIntersectionW;
B2DPolyRange aIntersectionNE;
B2DPolyRange aIntersectionSE;
B2DPolyRange aIntersectionSW;
B2DPolyRange aIntersectionNW;
B2DPolyRange aRingIntersection;
B2DPolyRange aRingIntersection2;
B2DPolyRange aRingIntersectExtraStrip;
B2DPolyRange aComplexIntersections;
B2DPolyRange aRandomIntersections;
public:
// initialise your test code values here.
void setUp()
{
B2DRange aCenter(100, 100, -100, -100);
B2DRange aOffside(800, 800, 1000, 1000);
B2DRange aNorth(100, 0, -100, -200);
B2DRange aSouth(100, 200, -100, 0);
B2DRange aEast(0, 100, 200, -100);
B2DRange aWest(-200, 100, 0, -100);
B2DRange aNorthEast(0, 0, 200, -200);
B2DRange aSouthEast(0, 0, 200, 200);
B2DRange aSouthWest(0, 0, -200, 200);
B2DRange aNorthWest(0, 0, -200, -200);
B2DRange aNorth2(-150, 50, 150, 350);
B2DRange aSouth2(-150, -50, 150, -350);
B2DRange aEast2 (50, -150, 350, 150);
B2DRange aWest2 (-50, -150,-350, 150);
aDisjunctRanges.appendElement( aCenter, ORIENTATION_NEGATIVE );
aDisjunctRanges.appendElement( aOffside, ORIENTATION_NEGATIVE );
aEqualRanges.appendElement( aCenter, ORIENTATION_NEGATIVE );
aEqualRanges.appendElement( aCenter, ORIENTATION_NEGATIVE );
aIntersectionN.appendElement( aCenter, ORIENTATION_NEGATIVE );
aIntersectionN.appendElement( aNorth, ORIENTATION_NEGATIVE );
aIntersectionE.appendElement( aCenter, ORIENTATION_NEGATIVE );
aIntersectionE.appendElement( aEast, ORIENTATION_NEGATIVE );
aIntersectionS.appendElement( aCenter, ORIENTATION_NEGATIVE );
aIntersectionS.appendElement( aSouth, ORIENTATION_NEGATIVE );
aIntersectionW.appendElement( aCenter, ORIENTATION_NEGATIVE );
aIntersectionW.appendElement( aWest, ORIENTATION_NEGATIVE );
aIntersectionNE.appendElement( aCenter, ORIENTATION_NEGATIVE );
aIntersectionNE.appendElement( aNorthEast, ORIENTATION_NEGATIVE );
aIntersectionSE.appendElement( aCenter, ORIENTATION_NEGATIVE );
aIntersectionSE.appendElement( aSouthEast, ORIENTATION_NEGATIVE );
aIntersectionSW.appendElement( aCenter, ORIENTATION_NEGATIVE );
aIntersectionSW.appendElement( aSouthWest, ORIENTATION_NEGATIVE );
aIntersectionNW.appendElement( aCenter, ORIENTATION_NEGATIVE );
aIntersectionNW.appendElement( aNorthWest, ORIENTATION_NEGATIVE );
aRingIntersection.appendElement( aNorth2, ORIENTATION_NEGATIVE );
aRingIntersection.appendElement( aEast2, ORIENTATION_NEGATIVE );
aRingIntersection.appendElement( aSouth2, ORIENTATION_NEGATIVE );
aRingIntersection2 = aRingIntersection;
aRingIntersection2.appendElement( aWest2, ORIENTATION_NEGATIVE );
aRingIntersectExtraStrip = aRingIntersection2;
aRingIntersectExtraStrip.appendElement( B2DRange(0, -25, 200, 25),
ORIENTATION_NEGATIVE );
aComplexIntersections.appendElement( aCenter, ORIENTATION_NEGATIVE );
aComplexIntersections.appendElement( aOffside, ORIENTATION_NEGATIVE );
aComplexIntersections.appendElement( aCenter, ORIENTATION_NEGATIVE );
aComplexIntersections.appendElement( aNorth, ORIENTATION_NEGATIVE );
aComplexIntersections.appendElement( aEast, ORIENTATION_NEGATIVE );
aComplexIntersections.appendElement( aSouth, ORIENTATION_NEGATIVE );
aComplexIntersections.appendElement( aWest, ORIENTATION_NEGATIVE );
aComplexIntersections.appendElement( aNorthEast, ORIENTATION_NEGATIVE );
aComplexIntersections.appendElement( aSouthEast, ORIENTATION_NEGATIVE );
aComplexIntersections.appendElement( aSouthWest, ORIENTATION_NEGATIVE );
aComplexIntersections.appendElement( aNorthWest, ORIENTATION_NEGATIVE );
#ifdef GENERATE_RANDOM
for( int i=0; i<800; ++i )
{
B2DRange aRandomRange(
getRandomOrdinal( 1000 ),
getRandomOrdinal( 1000 ),
getRandomOrdinal( 1000 ),
getRandomOrdinal( 1000 ) );
aRandomIntersections.appendElement( aRandomRange, ORIENTATION_NEGATIVE );
}
#else
const char* randomSvg="m394 783h404v57h-404zm-197-505h571v576h-571zm356-634h75v200h-75zm-40-113h403v588h-403zm93-811h111v494h-111zm-364-619h562v121h-562zm-134-8h292v27h-292zm110 356h621v486h-621zm78-386h228v25h-228zm475-345h201v201h-201zm-2-93h122v126h-122zm-417-243h567v524h-567zm-266-738h863v456h-863zm262-333h315v698h-315zm-328-826h43v393h-43zm830-219h120v664h-120zm-311-636h221v109h-221zm-500 137h628v19h-628zm681-94h211v493h-211zm-366-646h384v355h-384zm-189-199h715v247h-715zm165-459h563v601h-563zm258-479h98v606h-98zm270-517h65v218h-65zm-44-259h96v286h-96zm-599-202h705v468h-705zm216-803h450v494h-450zm-150-22h26v167h-26zm-55-599h50v260h-50zm190-278h490v387h-490zm-290-453h634v392h-634zm257 189h552v300h-552zm-151-690h136v455h-136zm12-597h488v432h-488zm501-459h48v39h-48zm-224-112h429v22h-429zm-281 102h492v621h-492zm519-158h208v17h-208zm-681-563h56v427h-56zm126-451h615v392h-615zm-47-410h598v522h-598zm-32 316h79v110h-79zm-71-129h18v127h-18zm126-993h743v589h-743zm211-430h428v750h-428zm61-554h100v220h-100zm-353-49h658v157h-658zm778-383h115v272h-115zm-249-541h119v712h-119zm203 86h94v40h-94z";
B2DPolyPolygon randomPoly;
tools::importFromSvgD(
randomPoly,
rtl::OUString::createFromAscii(randomSvg));
std::for_each(randomPoly.begin(),
randomPoly.end(),
boost::bind(
&B2DPolyRange::appendElement,
boost::ref(aRandomIntersections),
boost::bind(
&B2DPolygon::getB2DRange,
_1),
ORIENTATION_NEGATIVE,
1));
#endif
}
void tearDown()
{
}
B2DPolyPolygon normalizePoly( const B2DPolyPolygon& rPoly )
{
B2DPolyPolygon aRes;
for( sal_uInt32 i=0; i<rPoly.count(); ++i )
{
B2DPolygon aTmp=rPoly.getB2DPolygon(i);
if( ORIENTATION_NEGATIVE == tools::getOrientation(aTmp) )
aTmp.flip();
aTmp=tools::removeNeutralPoints(aTmp);
B2DPoint* pSmallest=0;
for(B2DPoint* pCurr=aTmp.begin(); pCurr!=aTmp.end(); ++pCurr)
{
if( ! pSmallest || compare(*pCurr, *pSmallest) )
{
pSmallest=pCurr;
}
}
if( pSmallest )
std::rotate(aTmp.begin(),pSmallest,aTmp.end());
aRes.append(aTmp);
}
// boxclipper & generic clipper disagree slightly on area-less
// polygons (one or two points only)
aRes = tools::stripNeutralPolygons(aRes);
// now, sort all polygons with increasing 0th point
std::sort(aRes.begin(),
aRes.end(),
boost::bind(
&compare,
boost::bind(
&B2DPolygon::getB2DPoint,
_1,0),
boost::bind(
&B2DPolygon::getB2DPoint,
_2,0)));
return aRes;
}
void verifyPoly(const char* sName, const char* sSvg, const B2DPolyRange& toTest)
{
B2DPolyPolygon aTmp1;
CPPUNIT_ASSERT_MESSAGE(sName,
tools::importFromSvgD(
aTmp1,
rtl::OUString::createFromAscii(sSvg)));
const rtl::OUString aSvg=
tools::exportToSvgD(toTest.solveCrossovers());
B2DPolyPolygon aTmp2;
CPPUNIT_ASSERT_MESSAGE(sName,
tools::importFromSvgD(
aTmp2,
aSvg));
CPPUNIT_ASSERT_MESSAGE(
sName,
normalizePoly(aTmp2) == normalizePoly(aTmp1));
}
void verifyPoly()
{
const char* disjunct="m-100-100v200h200v-200zm900 900v200h200v-200z";
const char* equal="m-100-100v200h200v-200zm200 0h-200v200h200v-200z";
const char* intersectionN="m-100-100v100h200v-100zm200 0v-100h-200v100 200h200v-200z";
const char* intersectionE="m0-100v200h100v-200zm0 0h-100v200h100 200v-200z";
const char* intersectionS="m-100 0v100h200v-100zm0-100v200 100h200v-100-200z";
const char* intersectionW="m-100-100v200h100v-200zm0 0h-100v200h100 200v-200z";
const char* intersectionNE="m0-100v100h100v-100zm0-100v100h-100v200h200v-100h100v-200z";
const char* intersectionSE="m0 0v100h100v-100zm100 0v-100h-200v200h100v100h200v-200z";
const char* intersectionSW="m-100 0v100h100v-100zm0-100v100h-100v200h200v-100h100v-200z";
const char* intersectionNW="m-100-100v100h100v-100zm100 0v-100h-200v200h100v100h200v-200z";
const char* ringIntersection="m50-150v100h100v-100zm0 200v100h100v-100zm100-200v-200h-300v300h200v100h-200v300h300v-200h200v-300z";
const char* ringIntersection2="m-150 50v100h100v-100zm0-200v100h100v-100zm100 200v-100h100v100z"
"m100-200v100h100v-100zm0 200v100h100v-100zm100-200v-200h-300v200h-200v300h200v200h300v-200h200v-300z";
const char* ringIntersectExtraStrip="m-150 50v100h100v-100zm0-200v100h100v-100zm100 200v-100h100v25h-50v50h50v25z"
"m100-200v100h100v-100zm0 200v100h100v-100zm0-75v50h150v-50z"
"m100-125v-200h-300v200h-200v300h200v200h300v-200h200v-300z";
const char* complexIntersections="m0 0zm0 0zm0 0zm0 0v-100 100h-100 100v100-100h100zm0 0v-100 100h-100 100v100-100h100z"
"m100 0v-100h-100-100v100 100h100 100v-100zm0 0v-100h-100-100v100 100h100 100v-100z"
"m0 0v-100h-100v-100 100h-100v100h-100 100v100h100v100-100h100v-100h100z"
"m0-100v-100h-100-100v100h-100v100 100h100v100h100 100v-100h100v-100-100z"
"m100 0v-100h-200-100-100v100 200 100h100 100 200v-100-200zm600 900v200h200v-200z";
const char* randomIntersections="m20-4515v393h43v-393zm34-8690v127h18v-127zm24 674v427h56v-427zm126-451v16-16z"
"m22 3470v260h50v-260zm55 599v167h26v-167zm-49-1831v455h136v-455z"
"m10 8845v19h158v-19zm54-38v25h228v-25zm156-13245v108h100v-108z"
"m101 14826v200h75v-200zm-205-3000v365h315v-365zm-309-1877v19h628v-19z"
"m549-1398v127h98v-127zm18 5351v215h111v-215zm-362-10061v152h488v-152z"
"m488 0v-469h-492v621h4v280h488v-432zm-378 5368v48h384v-48zm274-10182v712h119v-712z"
"m-424 3173v-94h-47v110h47v96h551v-112zm-105-2249v157h353v112h100v-112h205v-157z"
"m284 5177v203h377v-203zm337 4727v66h40v-66zm-326 6110v57h374v-57zm351-12583v39h48v-39z"
"m23 12583v-505h-571v576h571v-14h30v-57zm-368-2682v-8h-292v27h134v102h562v-121z"
"m-9-12299v320h428v-320zm364 1216v-410h-598v316h-32v110h32v96h47v280h615v-392z"
"m-537 11431v486h388v279h111v-279h122v-486zm112-4621v142h550v-142zm101-2719v494h450v-494z"
"m340 6609v33h120v-33zm-85-4349v-479h-98v479h-258v459h-165v247h189v307h384v-307h142v-105h13v-601z"
"m-270-3159v36h490v-36zm442 2163v7h52v-7zm-345 7158v588h403v-588zm378-1813v-93h-122v126h2v155h148v-188z"
"m19-5345v-259h-96v266h44v20h52v-20h10v-7zm-91-6571v-430h-428v430h-211v589h743v-589z"
"m101 6571v-461h-705v468h599v20h44v191h65v-218zm-89-8442v40h94v-40zm-71 10742v-43h-221v109h181v427h211v-493z"
"m0-4727v-189h-634v392h257v97h33v351h490v-351h29v-300zm-97 6698v-333h-315v333h-262v456h863v-456z"
"m-142-8556v22h429v-22zm238-56v17h208v-17zm91 7234v664h120v-664zm69 2452v-336h-567v524h419v13h201v-201z"
"m-42-13332v272h115v-272z";
verifyPoly("disjunct", disjunct, aDisjunctRanges);
verifyPoly("equal", equal, aEqualRanges);
verifyPoly("intersectionN", intersectionN, aIntersectionN);
verifyPoly("intersectionE", intersectionE, aIntersectionE);
verifyPoly("intersectionS", intersectionS, aIntersectionS);
verifyPoly("intersectionW", intersectionW, aIntersectionW);
verifyPoly("intersectionNE", intersectionNE, aIntersectionNE);
verifyPoly("intersectionSE", intersectionSE, aIntersectionSE);
verifyPoly("intersectionSW", intersectionSW, aIntersectionSW);
verifyPoly("intersectionNW", intersectionNW, aIntersectionNW);
verifyPoly("ringIntersection", ringIntersection, aRingIntersection);
verifyPoly("ringIntersection2", ringIntersection2, aRingIntersection2);
verifyPoly("ringIntersectExtraStrip", ringIntersectExtraStrip, aRingIntersectExtraStrip);
verifyPoly("complexIntersections", complexIntersections, aComplexIntersections);
verifyPoly("randomIntersections", randomIntersections, aRandomIntersections);
}
void dumpSvg(const char* pName,
const ::basegfx::B2DPolyPolygon& rPoly)
{
(void)pName; (void)rPoly;
#if defined(VERBOSE)
fprintf(stderr, "%s - svg:d=\"%s\"\n",
pName, rtl::OUStringToOString(
basegfx::tools::exportToSvgD(rPoly),
RTL_TEXTENCODING_UTF8).getStr() );
#endif
}
void getPolyPolygon()
{
dumpSvg("disjunct",aDisjunctRanges.solveCrossovers());
dumpSvg("equal",aEqualRanges.solveCrossovers());
dumpSvg("intersectionN",aIntersectionN.solveCrossovers());
dumpSvg("intersectionE",aIntersectionE.solveCrossovers());
dumpSvg("intersectionS",aIntersectionS.solveCrossovers());
dumpSvg("intersectionW",aIntersectionW.solveCrossovers());
dumpSvg("intersectionNE",aIntersectionNE.solveCrossovers());
dumpSvg("intersectionSE",aIntersectionSE.solveCrossovers());
dumpSvg("intersectionSW",aIntersectionSW.solveCrossovers());
dumpSvg("intersectionNW",aIntersectionNW.solveCrossovers());
dumpSvg("ringIntersection",aRingIntersection.solveCrossovers());
dumpSvg("ringIntersection2",aRingIntersection2.solveCrossovers());
dumpSvg("aRingIntersectExtraStrip",aRingIntersectExtraStrip.solveCrossovers());
dumpSvg("complexIntersections",aComplexIntersections.solveCrossovers());
dumpSvg("randomIntersections",aRandomIntersections.solveCrossovers());
CPPUNIT_ASSERT_MESSAGE("getPolyPolygon", true );
}
void validatePoly( const char* pName, const B2DPolyRange& rRange )
{
B2DPolyPolygon genericClip;
const sal_uInt32 nCount=rRange.count();
for( sal_uInt32 i=0; i<nCount; ++i )
{
B2DPolygon aRect=tools::createPolygonFromRect(
rRange.getElement(i).head);
if( rRange.getElement(i).tail.head == ORIENTATION_NEGATIVE )
aRect.flip();
genericClip.append(aRect);
}
#if defined(VERBOSE)
fprintf(stderr, "%s input - svg:d=\"%s\"\n",
pName, rtl::OUStringToOString(
basegfx::tools::exportToSvgD(
genericClip),
RTL_TEXTENCODING_UTF8).getStr() );
#endif
const B2DPolyPolygon boxClipResult=rRange.solveCrossovers();
const rtl::OUString boxClipSvg(
basegfx::tools::exportToSvgD(
normalizePoly(
boxClipResult)));
#if defined(VERBOSE)
fprintf(stderr, "%s boxclipper - svg:d=\"%s\"\n",
pName, rtl::OUStringToOString(
boxClipSvg,
RTL_TEXTENCODING_UTF8).getStr() );
#endif
genericClip = tools::solveCrossovers(genericClip);
const rtl::OUString genericClipSvg(
basegfx::tools::exportToSvgD(
normalizePoly(
genericClip)));
#if defined(VERBOSE)
fprintf(stderr, "%s genclipper - svg:d=\"%s\"\n",
pName, rtl::OUStringToOString(
genericClipSvg,
RTL_TEXTENCODING_UTF8).getStr() );
#endif
CPPUNIT_ASSERT_MESSAGE(pName,
genericClipSvg == boxClipSvg);
}
void validatePoly()
{
validatePoly("disjunct", aDisjunctRanges);
validatePoly("equal", aEqualRanges);
validatePoly("intersectionN", aIntersectionN);
validatePoly("intersectionE", aIntersectionE);
validatePoly("intersectionS", aIntersectionS);
validatePoly("intersectionW", aIntersectionW);
validatePoly("intersectionNE", aIntersectionNE);
validatePoly("intersectionSE", aIntersectionSE);
validatePoly("intersectionSW", aIntersectionSW);
validatePoly("intersectionNW", aIntersectionNW);
// subtle differences on Solaris Intel, comparison not smart enough
// (due to floating point inaccuracies)
//validatePoly("ringIntersection", aRingIntersection);
//validatePoly("ringIntersection2", aRingIntersection2);
//validatePoly("ringIntersectExtraStrip", aRingIntersectExtraStrip);
// generic clipper buggy here, likely
//validatePoly("complexIntersections", aComplexIntersections);
//validatePoly("randomIntersections", aRandomIntersections);
}
// Change the following lines only, if you add, remove or rename
// member functions of the current class,
// because these macros are need by auto register mechanism.
CPPUNIT_TEST_SUITE(boxclipper);
CPPUNIT_TEST(validatePoly);
CPPUNIT_TEST(verifyPoly);
CPPUNIT_TEST(getPolyPolygon);
CPPUNIT_TEST_SUITE_END();
};
// -----------------------------------------------------------------------------
CPPUNIT_TEST_SUITE_REGISTRATION(basegfx2d::boxclipper);
} // namespace basegfx2d
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
