blob: 81ab431a26c882949b8b1ff52677083de2d6de1c (
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
|
#ifndef _SOLVE_SBASIS_H
#define _SOLVE_SBASIS_H
#include "point.h"
#include "sbasis.h"
namespace Geom{
class Point;
unsigned
crossing_count(Geom::Point const *V, /* Control pts of Bezier curve */
unsigned degree); /* Degree of Bezier curve */
void
find_parametric_bezier_roots(
Geom::Point const *w, /* The control points */
unsigned degree, /* The degree of the polynomial */
std::vector<double> & solutions, /* RETURN candidate t-values */
unsigned depth); /* The depth of the recursion */
unsigned
crossing_count(double const *V, /* Control pts of Bezier curve */
unsigned degree, /* Degree of Bezier curve */
double left_t, double right_t);
void
find_bernstein_roots(
double const *w, /* The control points */
unsigned degree, /* The degree of the polynomial */
std::vector<double> & solutions, /* RETURN candidate t-values */
unsigned depth, /* The depth of the recursion */
double left_t=0, double right_t=1);
};
#endif
/*
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:encoding=utf-8:textwidth=99 :
|