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
|
/*****
* beziercurve.h
* Author: John C. Bowman
*
* Render a Bezier curve.
*****/
#ifndef BEZIERCURVE_H
#define BEZIERCURVE_H
#include "drawelement.h"
namespace camp {
#ifdef HAVE_GL
extern const double Fuzz;
extern const double Fuzz2;
struct BezierCurve
{
static std::vector<GLfloat> buffer;
static std::vector<GLuint> indices;
GLuint nvertices;
double res,res2;
triple Min,Max;
BezierCurve() : nvertices(0) {}
void init(double res, const triple& Min, const triple& Max);
// Store the vertex v in the buffer.
GLuint vertex(const triple &v) {
buffer.push_back(v.getx());
buffer.push_back(v.gety());
buffer.push_back(v.getz());
return nvertices++;
}
// Approximate bounds by bounding box of control polyhedron.
bool offscreen(size_t n, const triple *v) {
double x,y,z;
double X,Y,Z;
boundstriples(x,y,z,X,Y,Z,n,v);
return
X < Min.getx() || x > Max.getx() ||
Y < Min.gety() || y > Max.gety() ||
Z < Min.getz() || z > Max.getz();
}
void clear() {
nvertices=0;
buffer.clear();
indices.clear();
}
~BezierCurve() {
clear();
}
void render(const triple *p, GLuint I0, GLuint I1);
void render(const triple *p, bool straight);
void queue(const triple *g, bool straight, double ratio,
const triple& Min, const triple& Max) {
init(pixel*ratio,Min,Max);
render(g,straight);
}
void draw();
void draw(const triple *g, bool straight, double ratio,
const triple& Min, const triple& Max) {
queue(g,straight,ratio,Min,Max);
draw();
}
};
#endif
} //namespace camp
#endif
|
