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
|
/*************************************************************************
*
* $RCSfile: b2dpolypolygontools.cxx,v $
*
* $Revision: 1.3 $
*
* last change: $Author: aw $ $Date: 2003-11-11 09:48:14 $
*
* The Contents of this file are made available subject to the terms of
* either of the following licenses
*
* - GNU Lesser General Public License Version 2.1
* - Sun Industry Standards Source License Version 1.1
*
* Sun Microsystems Inc., October, 2000
*
* GNU Lesser General Public License Version 2.1
* =============================================
* Copyright 2000 by Sun Microsystems, Inc.
* 901 San Antonio Road, Palo Alto, CA 94303, USA
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, as published by the Free Software Foundation.
*
* This library 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 for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston,
* MA 02111-1307 USA
*
*
* Sun Industry Standards Source License Version 1.1
* =================================================
* The contents of this file are subject to the Sun Industry Standards
* Source License Version 1.1 (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.openoffice.org/license.html.
*
* Software provided under this License is provided on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,
* WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,
* MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.
* See the License for the specific provisions governing your rights and
* obligations concerning the Software.
*
* The Initial Developer of the Original Code is: Sun Microsystems, Inc.
*
* Copyright: 2000 by Sun Microsystems, Inc.
*
* All Rights Reserved.
*
* Contributor(s): _______________________________________
*
*
************************************************************************/
#ifndef _BGFX_POLYPOLYGON_B2DPOLYGONTOOLS_HXX
#include <basegfx/polygon/b2dpolypolygontools.hxx>
#endif
#ifndef _BGFX_POLYGON_B2DPOLYPOLYGON_HXX
#include <basegfx/polygon/b2dpolypolygon.hxx>
#endif
#ifndef _BGFX_POLYGON_B2DPOLYGON_HXX
#include <basegfx/polygon/b2dpolygon.hxx>
#endif
#ifndef _BGFX_POLYGON_B2DPOLYGONTOOLS_HXX
#include <basegfx/polygon/b2dpolygontools.hxx>
#endif
#ifndef _BGFX_NUMERIC_FTOOLS_HXX
#include <basegfx/numeric/ftools.hxx>
#endif
#ifndef _BGFX_POLYGON_B2DPOLYPOLYGONCUTTER_HXX
#include <basegfx/polygon/b2dpolypolygoncutter.hxx>
#endif
//////////////////////////////////////////////////////////////////////////////
namespace basegfx
{
namespace polygon
{
namespace tools
{
// B2DPolyPolygon tools
void correctOrientations(::basegfx::polygon::B2DPolyPolygon& rCandidate)
{
const sal_uInt32 nPolygonCount(rCandidate.count());
sal_uInt32 nIndexOfOutmostPolygon(0L);
sal_Bool bIndexOfOutmostPolygonSet(sal_False);
for(sal_uInt32 a(0L); a < nPolygonCount; a++)
{
::basegfx::polygon::B2DPolygon aCandidate = rCandidate.getPolygon(a);
if(aCandidate.count() > 2L)
{
::basegfx::vector::B2DVectorOrientation aOrientation =
::basegfx::polygon::tools::getOrientation(aCandidate);
sal_Bool bDoFlip(::basegfx::vector::ORIENTATION_POSITIVE != aOrientation);
// init values for depth and compare point for
// inside test. Since the ordering makes only sense when assuming
// that there are no intersections, the inside test is done with
// any point of the candidate, so teke the first one.
sal_uInt32 nDepth(0L);
const ::basegfx::point::B2DPoint aTestPoint(aCandidate.getB2DPoint(0L));
// loop over other polygons and calculate depth
for(sal_uInt32 b(0L); b < nPolygonCount; b++)
{
if(b != a)
{
::basegfx::polygon::B2DPolygon aComparePolygon = rCandidate.getPolygon(b);
if(::basegfx::polygon::tools::isInside(aComparePolygon, aTestPoint))
{
nDepth++;
}
}
}
// if nDepth is odd it is a hole
sal_Bool bIsHole(1L == (nDepth & 0x00000001));
// does polygon need to be flipped?
if((bDoFlip && !bIsHole) || (!bDoFlip && bIsHole))
{
aCandidate.flip();
// write back changed polygon
rCandidate.setPolygon(a, aCandidate);
}
// remember the index if it's the outmost polygon
if(!bIndexOfOutmostPolygonSet && 0L == nDepth)
{
bIndexOfOutmostPolygonSet = sal_True;
nIndexOfOutmostPolygon = a;
}
}
}
// if the outmost polygon is not the first, move it in front
if(bIndexOfOutmostPolygonSet && nIndexOfOutmostPolygon > 0L)
{
::basegfx::polygon::B2DPolygon aOutmostPolygon = rCandidate.getPolygon(nIndexOfOutmostPolygon);
rCandidate.remove(nIndexOfOutmostPolygon);
rCandidate.insert(0L, aOutmostPolygon);
}
}
void removeIntersections(::basegfx::polygon::B2DPolyPolygon& rCandidate,
sal_Bool bForceOrientation, sal_Bool bInvertRemove)
{
::basegfx::polygon::B2DPolyPolygonCutter aCutter;
aCutter.addPolyPolygon(rCandidate, bForceOrientation);
aCutter.removeSelfIntersections();
aCutter.removeDoubleIntersections();
aCutter.removeIncludedPolygons(!bInvertRemove);
rCandidate.clear();
aCutter.getPolyPolygon(rCandidate);
}
::basegfx::polygon::B2DPolyPolygon adaptiveSubdivide(const ::basegfx::polygon::B2DPolyPolygon& rCandidate, double fDistanceBound)
{
::basegfx::polygon::B2DPolyPolygon aRetval(rCandidate);
if(aRetval.areControlPointsUsed())
{
const sal_uInt32 nPolygonCount(aRetval.count());
for(sal_uInt32 a(0L); aRetval.areControlPointsUsed() && a < nPolygonCount; a++)
{
::basegfx::polygon::B2DPolygon aCandidate = aRetval.getPolygon(a);
if(aCandidate.areControlPointsUsed())
{
aCandidate = ::basegfx::polygon::tools::adaptiveSubdivide(aCandidate, fDistanceBound);
aRetval.setPolygon(a, aCandidate);
}
}
}
return aRetval;
}
} // end of namespace tools
} // end of namespace polygon
} // end of namespace basegfx
//////////////////////////////////////////////////////////////////////////////
// eof
|
