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
|
/* Abstract curve type - implementation of default methods
*
* Authors:
* MenTaLguY <mental@rydia.net>
* Marco Cecchetti <mrcekets at gmail.com>
* Krzysztof Kosiński <tweenk.pl@gmail.com>
*
* Copyright 2007-2009 Authors
*
* This library is free software; you can redistribute it and/or
* modify it either under the terms of the GNU Lesser General Public
* License version 2.1 as published by the Free Software Foundation
* (the "LGPL") or, at your option, under the terms of the Mozilla
* Public License Version 1.1 (the "MPL"). If you do not alter this
* notice, a recipient may use your version of this file under either
* the MPL or the LGPL.
*
* You should have received a copy of the LGPL along with this library
* in the file COPYING-LGPL-2.1; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
* You should have received a copy of the MPL along with this library
* in the file COPYING-MPL-1.1
*
* The contents of this file are subject to the Mozilla Public 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.mozilla.org/MPL/
*
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY
* OF ANY KIND, either express or implied. See the LGPL or the MPL for
* the specific language governing rights and limitations.
*/
#include <2geom/curve.h>
#include <2geom/nearest-point.h>
#include <2geom/sbasis-geometric.h>
#include <2geom/ord.h>
namespace Geom
{
int CurveHelpers::root_winding(Curve const &c, Point p) {
std::vector<double> ts = c.roots(p[Y], Y);
if(ts.empty()) return 0;
double const fudge = 0.01; //fudge factor used on first and last
std::sort(ts.begin(), ts.end());
// winding determined by crossings at roots
int wind=0;
// previous time
double pt = ts.front() - fudge;
for ( std::vector<double>::iterator ti = ts.begin()
; ti != ts.end()
; ++ti )
{
double t = *ti;
if ( t <= 0. || t >= 1. ) continue; //skip endpoint roots
if ( c.valueAt(t, X) > p[X] ) { // root is ray intersection
// Get t of next:
std::vector<double>::iterator next = ti;
++next;
double nt;
if(next == ts.end()) nt = t + fudge; else nt = *next;
// Check before in time and after in time for positions
// Currently we're using the average times between next and previous segs
Cmp after_to_ray = cmp(c.valueAt((t + nt) / 2, Y), p[Y]);
Cmp before_to_ray = cmp(c.valueAt((t + pt) / 2, Y), p[Y]);
// if y is included, these will have opposite values, giving order.
Cmp dt = cmp(after_to_ray, before_to_ray);
if(dt != EQUAL_TO) //Should always be true, but yah never know..
wind += dt;
pt = t;
}
}
return wind;
}
Coord Curve::nearestPoint(Point const& p, Coord a, Coord b) const
{
return nearest_point(p, toSBasis(), a, b);
}
std::vector<Coord> Curve::allNearestPoints(Point const& p, Coord from, Coord to) const
{
return all_nearest_points(p, toSBasis(), from, to);
}
Coord Curve::length(Coord tolerance) const
{
return ::Geom::length(toSBasis(), tolerance);
}
Point Curve::unitTangentAt(Coord t, unsigned n) const
{
std::vector<Point> derivs = pointAndDerivatives(t, n);
for (unsigned deriv_n = 1; deriv_n < derivs.size(); deriv_n++) {
Coord length = derivs[deriv_n].length();
if ( ! are_near(length, 0) ) {
// length of derivative is non-zero, so return unit vector
return derivs[deriv_n] / length;
}
}
return Point (0,0);
};
} // namespace Geom
/*
Local Variables:
mode:c++
c-file-style:"stroustrup"
c-file-offsets:((innamespace . 0)(inline-open . 0)(case-label . +))
indent-tabs-mode:nil
fill-column:99
End:
*/
// vim: filetype=cpp:expandtab:shiftwidth=4:tabstop=8:softtabstop=4:fileencoding=utf-8:textwidth=99 :
|
