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
|
// Begin License:
// Copyright (C) 2006-2011 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 the GNU General Public
// License version 2.0 as published by the Free Software Foundation
// and appearing in the file LICENSE.GPL2 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 line {
struct PolylineEdge;
struct Polyline;
struct polyline_vertex_const_iter;
struct polyline_vertex_iter;
struct polyline_edge_const_iter;
struct polyline_edge_iter;
struct Vertex : public tagable {
carve::geom3d::Vector v;
std::list<std::pair<PolylineEdge *, PolylineEdge *> > edge_pairs;
void addEdgePair(PolylineEdge *in, PolylineEdge *out) {
edge_pairs.push_back(std::make_pair(in, out));
}
};
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 PolylineEdge : public tagable {
Polyline *parent;
unsigned edgenum;
Vertex *v1, *v2;
PolylineEdge(Polyline *_parent, int _edgenum, Vertex *_v1, Vertex *_v2);
carve::geom3d::AABB aabb() const;
inline PolylineEdge *prevEdge() const;
inline PolylineEdge *nextEdge() const;
};
struct Polyline {
bool closed;
std::vector<PolylineEdge *> edges;
Polyline();
size_t vertexCount() const;
size_t edgeCount() const;
const PolylineEdge *edge(size_t e) const;
PolylineEdge *edge(size_t e);
const Vertex *vertex(size_t v) const;
Vertex *vertex(size_t v);
bool isClosed() const;
polyline_vertex_const_iter vbegin() const;
polyline_vertex_const_iter vend() const;
polyline_vertex_iter vbegin();
polyline_vertex_iter vend();
polyline_edge_const_iter ebegin() const;
polyline_edge_const_iter eend() const;
polyline_edge_iter ebegin();
polyline_edge_iter eend();
carve::geom3d::AABB aabb() const;
template<typename iter_t>
void _init(bool c, iter_t begin, iter_t end, std::vector<Vertex> &vertices);
template<typename iter_t>
void _init(bool closed, iter_t begin, iter_t end, std::vector<Vertex> &vertices, std::forward_iterator_tag);
template<typename iter_t>
void _init(bool closed, iter_t begin, iter_t end, std::vector<Vertex> &vertices, std::random_access_iterator_tag);
template<typename iter_t>
Polyline(bool closed, iter_t begin, iter_t end, std::vector<Vertex> &vertices);
~Polyline() {
for (size_t i = 0; i < edges.size(); ++i) {
delete edges[i];
}
}
};
struct PolylineSet {
typedef std::list<Polyline *> line_list;
typedef line_list::iterator line_iter;
typedef line_list::const_iterator const_line_iter;
std::vector<Vertex> vertices;
line_list lines;
carve::geom3d::AABB aabb;
PolylineSet(const std::vector<carve::geom3d::Vector> &points);
PolylineSet() {
}
~PolylineSet() {
for (line_iter i = lines.begin(); i != lines.end(); ++i) {
delete *i;
}
}
template<typename iter_t>
void addPolyline(bool closed, iter_t begin, iter_t end);
void sortVertices(const carve::geom3d::Vector &axis);
size_t vertexToIndex_fast(const Vertex *v) const;
};
}
}
|
