1 #ifndef VTESTBED_GEOMETRY_TYPES_HH 2 #define VTESTBED_GEOMETRY_TYPES_HH 7 #include <vtestbed/base/blitz.hh> 13 template <
class T,
int N>
14 using Vertex = blitz::TinyVector<T,N>;
16 template <
class T,
int N>
17 using Matrix = blitz::TinyMatrix<T,N,N>;
22 template <
class T,
int N>
class BSP_tree;
23 template <
class T,
int N>
class Basis;
24 template <
class T,
int N>
class Basis_spline;
25 template <
class T,
int N>
class Bezier_curve;
26 template <
class T,
int N>
class Coordinate_system;
27 template <
class T,
int N>
class Cubic_spline;
28 template <
class T,
int N>
class Curve_segments;
29 template <
class T,
int N>
class Line_segment;
30 template <
class T,
int N>
class Linear_interpolation;
31 template <
class T,
int N>
class Plane;
32 template <
class T,
int N>
class Polygon;
33 template <
class T,
int N>
class Polyhedron;
34 template <
class T,
int N>
class Polyline;
35 template <
class T,
int N>
class Ray;
36 template <
class T,
int N>
class Rectangle;
37 template <
class T,
int N>
class Rotation_matrix;
38 template <
class T,
int N>
class Tetrahedron;
39 template <
class T,
int N>
class Triangle;
43 template <
class T>
class Bounds;
45 template <
int N>
class Face;
47 enum class Plane_position: unsigned char;
54 template <
class T,
int N>
57 template <
class T,
int N>
60 template <
class T,
int N>
67 #endif // vim:filetype=cpp
Traverse BSP tree nodes using depth-first search.