blob: 1687768219a83da727ce29e5cae10243709d53e2 (
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
|
// Begin License:
// Copyright (C) 2006-2014 Tobias Sargeant (tobias.sargeant@gmail.com).
// All rights reserved.
//
// This file is part of the Carve CSG Library (http://carve-csg.com/)
//
// This file may be used under the terms of either the GNU General
// Public License version 2 or 3 (at your option) as published by the
// Free Software Foundation and appearing in the files LICENSE.GPL2
// and LICENSE.GPL3 included in the packaging of this file.
//
// This file is provided "AS IS" with NO WARRANTY OF ANY KIND,
// INCLUDING THE WARRANTIES OF DESIGN, MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE.
// End:
#pragma once
#include <iterator>
#include <list>
#include <iterator>
#include <limits>
#include <carve/carve.hpp>
#include <carve/tag.hpp>
#include <carve/geom.hpp>
#include <carve/kd_node.hpp>
#include <carve/geom3d.hpp>
#include <carve/aabb.hpp>
namespace carve {
namespace point {
struct Vertex : public tagable {
carve::geom3d::Vector v;
};
struct vec_adapt_vertex_ptr {
const carve::geom3d::Vector &operator()(const Vertex * const &v) { return v->v; }
carve::geom3d::Vector &operator()(Vertex *&v) { return v->v; }
};
struct PointSet {
std::vector<Vertex> vertices;
carve::geom3d::AABB aabb;
PointSet(const std::vector<carve::geom3d::Vector> &points);
PointSet() {
}
void sortVertices(const carve::geom3d::Vector &axis);
size_t vertexToIndex_fast(const Vertex *v) const;
};
}
}
|
