blob: d1e98c980f8e3ce5ba1c88483d786a08724e6a3e (
plain)
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
|
/* -*- 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/curve/b2dbeziertools.hxx>
#include <basegfx/curve/b2dcubicbezier.hxx>
#include <algorithm>
namespace basegfx
{
B2DCubicBezierHelper::B2DCubicBezierHelper(const B2DCubicBezier& rBase, sal_uInt32 nDivisions)
: maLengthArray(),
mnEdgeCount(0)
{
const bool bIsBezier(rBase.isBezier());
if(bIsBezier)
{
// check nDivisions; at least one is needed, but also prevent too big values
if(nDivisions < 1)
{
nDivisions = 1;
}
else if(nDivisions > 1000)
{
nDivisions = 1000;
}
// set nEdgeCount
mnEdgeCount = nDivisions + 1;
// fill in maLengthArray
maLengthArray.clear();
maLengthArray.reserve(mnEdgeCount);
B2DPoint aCurrent(rBase.getStartPoint());
double fLength(0.0);
for(sal_uInt32 a(1);;)
{
const B2DPoint aNext(rBase.interpolatePoint((double)a / (double)mnEdgeCount));
const B2DVector aEdge(aNext - aCurrent);
fLength += aEdge.getLength();
maLengthArray.push_back(fLength);
if(++a < mnEdgeCount)
{
aCurrent = aNext;
}
else
{
const B2DPoint& aLastNext(rBase.getEndPoint());
const B2DVector aLastEdge(aLastNext - aNext);
fLength += aLastEdge.getLength();
maLengthArray.push_back(fLength);
break;
}
}
}
else
{
maLengthArray.clear();
maLengthArray.push_back(rBase.getEdgeLength());
mnEdgeCount = 1;
}
}
double B2DCubicBezierHelper::distanceToRelative(double fDistance) const
{
if(fDistance <= 0.0)
{
return 0.0;
}
const double fLength(getLength());
if(fTools::moreOrEqual(fDistance, fLength))
{
return 1.0;
}
// fDistance is in ]0.0 .. fLength[
if(1 == mnEdgeCount)
{
// not a bezier, linear edge
return fDistance / fLength;
}
// it is a bezier
::std::vector< double >::const_iterator aIter = ::std::lower_bound(maLengthArray.begin(), maLengthArray.end(), fDistance);
const sal_uInt32 nIndex(aIter - maLengthArray.begin());
const double fHighBound(maLengthArray[nIndex]);
const double fLowBound(nIndex ? maLengthArray[nIndex - 1] : 0.0);
const double fLinearInterpolatedLength((fDistance - fLowBound) / (fHighBound - fLowBound));
return (static_cast< double >(nIndex) + fLinearInterpolatedLength) / static_cast< double >(mnEdgeCount);
}
} // end of namespace basegfx
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
