summaryrefslogtreecommitdiff
path: root/graphics/asymptote/bbox3.h
blob: e2428f8c001cc254e6c3adaf98a823d416e6adb5 (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
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
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
/*****
 * bbox3.h
 * Andy Hammerlindl 2002/06/06
 *
 * Stores a rectangle that encloses a drawing object.
 *****/

#ifndef BBOX3_H
#define BBOX3_H

#include "triple.h"

// For CYGWIN
#undef near
#undef far

namespace camp {

// The box that encloses a path
struct bbox3 {
  bool empty;
  double left;
  double bottom;
  double near;
  double right;
  double top;
  double far;

  // Start bbox3 about the origin
  bbox3()
    : empty(true), left(0.0), bottom(0.0), near(0.0),
      right(0.0), top(0.0), far(0.0)
  {
  }

  bbox3(double left, double bottom, double near,
        double right, double top, double far)
    : empty(false), left(left), bottom(bottom), near(near),
      right(right), top(top), far(far)
  {
  }

  // Start a bbox3 with a point
  bbox3(double x, double y, double z)
    : empty(false), left(x), bottom(y), near(z), right(x), top(y), far(z)
  {
  }

  // Start a bbox3 with a point
  bbox3(const triple& v)
    : empty(false), left(v.getx()), bottom(v.gety()), near(v.getz()),
      right(v.getx()), top(v.gety()), far(v.getz())
  {
  }

  // Start a bbox3 with 2 points
  bbox3(const triple& m, const triple& M)
    : empty(false),
      left(m.getx()), bottom(m.gety()), near(m.getz()),
      right(M.getx()),    top(M.gety()), far(M.getz())
  {
  }

  // Add a point to a bbox3
  void add(const triple& v)
  {
    const double x = v.getx(), y = v.gety(), z = v.getz();
    add(x,y,z);
  }
  void add(double x, double y, double z)
  {
    if (empty) {
      left = right = x;
      top = bottom = y;
      near = far = z;
      empty = false;
    }
    else {
      if(x < left)
        left = x;
      else if(x > right)
        right = x;
      if(y < bottom)
        bottom = y;
      else if(y > top)
        top = y;
      if(z < near)
        near = z;
      else if(z > far)
        far = z;
    }
  }

  // Add a point to a nonempty bbox3
  void addnonempty(double x, double y, double z)
  {
    if(x < left)
      left = x;
    else if(x > right)
      right = x;
    if(y < bottom)
      bottom = y;
    else if(y > top)
      top = y;
    if(z < near)
      near = z;
    else if(z > far)
      far = z;
  }

  // Add (x,y) pair to a nonempty bbox3
  void addnonempty(pair v)
  {
    double x=v.getx();
    if(x < left)
      left = x;
    else if(x > right)
      right = x;
    double y=v.gety();
    if(y < bottom)
      bottom = y;
    else if(y > top)
      top = y;
  }

  // Add a point to a nonempty bbox3
  void addnonempty(const triple& v)
  {
    addnonempty(v.getx(),v.gety(),v.getz());
  }

  // Add a point to a nonempty bbox, updating bounding times
  void addnonempty(const triple& v, bbox3& times, double t)
  {
    double x = v.getx(), y = v.gety(), z = v.getz();

    if(x < left) {
      left = x;
      times.left = t;
    }
    else if(x > right) {
      right = x;
      times.right = t;
    }
    if(y < bottom) {
      bottom = y;
      times.bottom = t;
    }
    else if(y > top) {
      top = y;
      times.top = t;
    }
    if(z < near) {
      near = z;
      times.near=t;
    }
    else if(z > far) {
      far = z;
      times.far=t;
    }
  }

  bbox3 operator+= (const triple& v)
  {
    add(v);
    return *this;
  }

  triple Min() const {
    return triple(left,bottom,near);
  }

  triple Max() const {
    return triple(right,top,far);
  }

  pair Min2() const {
    return pair(left,bottom);
  }

  pair Max2() const {
    return pair(right,top);
  }

  friend ostream& operator << (ostream& out, const bbox3& b)
  {
    out << "Min " << b.Min() << " Max " << b.Max();
    return out;
  }

};

} // namespace camp

GC_DECLARE_PTRFREE(camp::bbox3);

#endif