1 /**
2 * \file
3 * \brief \todo brief description
4 *
5 * Authors:
6 * ? <?@?.?>
7 *
8 * Copyright ?-? authors
9 *
10 * This library is free software; you can redistribute it and/or
11 * modify it either under the terms of the GNU Lesser General Public
12 * License version 2.1 as published by the Free Software Foundation
13 * (the "LGPL") or, at your option, under the terms of the Mozilla
14 * Public License Version 1.1 (the "MPL"). If you do not alter this
15 * notice, a recipient may use your version of this file under either
16 * the MPL or the LGPL.
17 *
18 * You should have received a copy of the LGPL along with this library
19 * in the file COPYING-LGPL-2.1; if not, write to the Free Software
20 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
21 * You should have received a copy of the MPL along with this library
22 * in the file COPYING-MPL-1.1
23 *
24 * The contents of this file are subject to the Mozilla Public License
25 * Version 1.1 (the "License"); you may not use this file except in
26 * compliance with the License. You may obtain a copy of the License at
27 * http://www.mozilla.org/MPL/
28 *
29 * This software is distributed on an "AS IS" basis, WITHOUT WARRANTY
30 * OF ANY KIND, either express or implied. See the LGPL or the MPL for
31 * the specific language governing rights and limitations.
32 *
33 */
35 #ifndef _SOLVE_SBASIS_H
36 #define _SOLVE_SBASIS_H
37 #include <2geom/point.h>
38 #include <2geom/sbasis.h>
40 namespace Geom{
42 class Point;
44 unsigned
45 crossing_count(Geom::Point const *V, /* Control pts of Bezier curve */
46 unsigned degree); /* Degree of Bezier curve */
47 void
48 find_parametric_bezier_roots(
49 Geom::Point const *w, /* The control points */
50 unsigned degree, /* The degree of the polynomial */
51 std::vector<double> & solutions, /* RETURN candidate t-values */
52 unsigned depth); /* The depth of the recursion */
54 unsigned
55 crossing_count(double const *V, /* Control pts of Bezier curve */
56 unsigned degree, /* Degree of Bezier curve */
57 double left_t, double right_t);
58 void
59 find_bernstein_roots(
60 double const *w, /* The control points */
61 unsigned degree, /* The degree of the polynomial */
62 std::vector<double> & solutions, /* RETURN candidate t-values */
63 unsigned depth, /* The depth of the recursion */
64 double left_t=0, double right_t=1, bool use_secant=true);
66 };
67 #endif
69 /*
70 Local Variables:
71 mode:c++
72 c-file-style:"stroustrup"
73 c-file-offsets:((innamespace . 0)(inline-open . 0)(case-label . +))
74 indent-tabs-mode:nil
75 fill-column:99
76 End:
77 */
78 // vim: filetype=cpp:expandtab:shiftwidth=4:tabstop=8:softtabstop=4:encoding=utf-8:textwidth=99 :