Codebase list asymptote / upstream/2.80+ds beziercurve.h
upstream/2.80+ds

Tree @upstream/2.80+ds (Download .tar.gz)

beziercurve.h @upstream/2.80+ds — raw · history · blame 

 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
/*****
 * 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
{
  vertexBuffer data;
  double res,res2;
  bool Onscreen;

  void init(double res);

  // Approximate bounds by bounding box of control polyhedron.
  bool offscreen(size_t n, const triple *v) {
    if(bbox2(n,v).offscreen()) {
      Onscreen=false;
      return true;
    }
    return false;
  }

  void render(const triple *p, bool straight);
  void render(const triple *p, GLuint I0, GLuint I1);

  void append() {
    material1Data.append(data);
  }

  void notRendered() {
    material1Data.rendered=false;
  }

  void queue(const triple *g, bool straight, double ratio) {
    data.clear();
    notRendered();
    Onscreen=true;
    init(pixelResolution*ratio);
    render(g,straight);
  }

};

struct Pixel
{
  vertexBuffer data;

  void append() {
    material0Data.append0(data);
  }

  void queue(const triple& p, double width) {
    data.clear();
    MaterialIndex=materialIndex;
    data.indices.push_back(data.vertex0(p,width));
    append();
  }

  void draw();
};

#endif

} //namespace camp

#endif