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
|
/* -*- 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 <basegfx/polygon/b2dpolygon.hxx>
#include <basegfx/polygon/b2dpolygontools.hxx>
#include <svx/polypolygoneditor.hxx>
namespace sdr {
PolyPolygonEditor::PolyPolygonEditor( const basegfx::B2DPolyPolygon& rPolyPolygon)
: maPolyPolygon( rPolyPolygon )
{
}
bool PolyPolygonEditor::DeletePoints( const std::set< sal_uInt16 >& rAbsPoints )
{
bool bPolyPolyChanged = false;
std::set< sal_uInt16 >::const_reverse_iterator aIter( rAbsPoints.rbegin() );
for( ; aIter != rAbsPoints.rend(); ++aIter )
{
sal_uInt32 nPoly, nPnt;
if( GetRelativePolyPoint(maPolyPolygon,(*aIter), nPoly, nPnt) )
{
// remove point
basegfx::B2DPolygon aCandidate(maPolyPolygon.getB2DPolygon(nPoly));
aCandidate.remove(nPnt);
if( aCandidate.count() < 2 )
{
maPolyPolygon.remove(nPoly);
}
else
{
maPolyPolygon.setB2DPolygon(nPoly, aCandidate);
}
bPolyPolyChanged = true;
}
}
return bPolyPolyChanged;
}
bool PolyPolygonEditor::SetSegmentsKind(SdrPathSegmentKind eKind, const std::set< sal_uInt16 >& rAbsPoints )
{
bool bPolyPolyChanged = false;
std::set< sal_uInt16 >::const_reverse_iterator aIter( rAbsPoints.rbegin() );
for( ; aIter != rAbsPoints.rend(); ++aIter )
{
sal_uInt32 nPolyNum, nPntNum;
if(PolyPolygonEditor::GetRelativePolyPoint(maPolyPolygon, (*aIter), nPolyNum, nPntNum))
{
// do change at aNewPolyPolygon. Take a look at edge.
basegfx::B2DPolygon aCandidate(maPolyPolygon.getB2DPolygon(nPolyNum));
const sal_uInt32 nCount(aCandidate.count());
if(nCount && (nPntNum + 1 < nCount || aCandidate.isClosed()))
{
bool bCandidateChanged(false);
// it's a valid edge, check control point usage
const sal_uInt32 nNextIndex((nPntNum + 1) % nCount);
const bool bContolUsed(aCandidate.areControlPointsUsed()
&& (aCandidate.isNextControlPointUsed(nPntNum) || aCandidate.isPrevControlPointUsed(nNextIndex)));
if(bContolUsed)
{
if(SdrPathSegmentKind::Toggle == eKind || SdrPathSegmentKind::Line == eKind)
{
// remove control
aCandidate.resetNextControlPoint(nPntNum);
aCandidate.resetPrevControlPoint(nNextIndex);
bCandidateChanged = true;
}
}
else
{
if(SdrPathSegmentKind::Toggle == eKind || SdrPathSegmentKind::Curve == eKind)
{
// add control
const basegfx::B2DPoint aStart(aCandidate.getB2DPoint(nPntNum));
const basegfx::B2DPoint aEnd(aCandidate.getB2DPoint(nNextIndex));
aCandidate.setNextControlPoint(nPntNum, interpolate(aStart, aEnd, (1.0 / 3.0)));
aCandidate.setPrevControlPoint(nNextIndex, interpolate(aStart, aEnd, (2.0 / 3.0)));
bCandidateChanged = true;
}
}
if(bCandidateChanged)
{
maPolyPolygon.setB2DPolygon(nPolyNum, aCandidate);
bPolyPolyChanged = true;
}
}
}
}
return bPolyPolyChanged;
}
bool PolyPolygonEditor::SetPointsSmooth( basegfx::B2VectorContinuity eFlags, const std::set< sal_uInt16 >& rAbsPoints)
{
bool bPolyPolygonChanged(false);
std::set< sal_uInt16 >::const_reverse_iterator aIter( rAbsPoints.rbegin() );
for( ; aIter != rAbsPoints.rend(); ++aIter )
{
sal_uInt32 nPolyNum, nPntNum;
if(PolyPolygonEditor::GetRelativePolyPoint(maPolyPolygon, (*aIter), nPolyNum, nPntNum))
{
// do change at aNewPolyPolygon...
basegfx::B2DPolygon aCandidate(maPolyPolygon.getB2DPolygon(nPolyNum));
// set continuity in point, make sure there is a curve
bool bPolygonChanged = basegfx::utils::expandToCurveInPoint(aCandidate, nPntNum);
bPolygonChanged |= basegfx::utils::setContinuityInPoint(aCandidate, nPntNum, eFlags);
if(bPolygonChanged)
{
maPolyPolygon.setB2DPolygon(nPolyNum, aCandidate);
bPolyPolygonChanged = true;
}
}
}
return bPolyPolygonChanged;
}
bool PolyPolygonEditor::GetRelativePolyPoint( const basegfx::B2DPolyPolygon& rPoly, sal_uInt32 nAbsPnt, sal_uInt32& rPolyNum, sal_uInt32& rPointNum )
{
const sal_uInt32 nPolyCount(rPoly.count());
sal_uInt32 nPolyNum(0);
while(nPolyNum < nPolyCount)
{
const sal_uInt32 nPointCount(rPoly.getB2DPolygon(nPolyNum).count());
if(nAbsPnt < nPointCount)
{
rPolyNum = nPolyNum;
rPointNum = nAbsPnt;
return true;
}
else
{
nPolyNum++;
nAbsPnt -= nPointCount;
}
}
return false;
}
} // end of namespace sdr
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
