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
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
|
// 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 <list>
#include <vector>
#include <algorithm>
#include <carve/carve.hpp>
#include <carve/geom3d.hpp>
#include <carve/mesh.hpp>
#include <carve/collection_types.hpp>
#include <carve/classification.hpp>
#include <carve/iobj.hpp>
#include <carve/faceloop.hpp>
#include <carve/intersection.hpp>
#include <carve/rtree.hpp>
namespace carve {
namespace csg {
class VertexPool {
typedef carve::mesh::MeshSet<3>::vertex_t vertex_t;
const static unsigned blocksize = 1024;
typedef std::list<std::vector<vertex_t> > pool_t;
pool_t pool;
public:
void reset();
vertex_t *get(const vertex_t::vector_t &v = vertex_t::vector_t::ZERO());
bool inPool(vertex_t *v) const;
VertexPool();
~VertexPool();
};
namespace detail {
struct Data;
class LoopEdges;
}
/**
* \class CSG
* \brief The class responsible for the computation of CSG operations.
*
*/
class CSG {
private:
public:
typedef carve::mesh::MeshSet<3> meshset_t;
struct Hook {
/**
* \class Hook
* \brief Provides API access to intermediate steps in CSG calculation.
*
*/
virtual void intersectionVertex(const meshset_t::vertex_t * /* vertex */,
const IObjPairSet & /* intersections */) {
}
virtual void processOutputFace(std::vector<meshset_t::face_t *> & /* faces */,
const meshset_t::face_t * /* orig_face */,
bool /* flipped */) {
}
virtual void resultFace(const meshset_t::face_t * /* new_face */,
const meshset_t::face_t * /* orig_face */,
bool /* flipped */) {
}
virtual void edgeDivision(const meshset_t::edge_t * /* orig_edge */,
size_t /* orig_edge_idx */,
const meshset_t::vertex_t * /* v1 */,
const meshset_t::vertex_t * /* v2 */) {
}
virtual ~Hook() {
}
};
/**
* \class Hooks
* \brief Management of API hooks.
*
*/
class Hooks {
public:
enum {
RESULT_FACE_HOOK = 0,
PROCESS_OUTPUT_FACE_HOOK = 1,
INTERSECTION_VERTEX_HOOK = 2,
EDGE_DIVISION_HOOK = 3,
HOOK_MAX = 4,
RESULT_FACE_BIT = 0x0001,
PROCESS_OUTPUT_FACE_BIT = 0x0002,
INTERSECTION_VERTEX_BIT = 0x0004,
EDGE_DIVISION_BIT = 0x0008
};
std::vector<std::list<Hook *> > hooks;
bool hasHook(unsigned hook_num);
void intersectionVertex(const meshset_t::vertex_t *vertex,
const IObjPairSet &intersections);
void processOutputFace(std::vector<meshset_t::face_t *> &faces,
const meshset_t::face_t *orig_face,
bool flipped);
void resultFace(const meshset_t::face_t *new_face,
const meshset_t::face_t *orig_face,
bool flipped);
void edgeDivision(const meshset_t::edge_t *orig_edge,
size_t orig_edge_idx,
const meshset_t::vertex_t *v1,
const meshset_t::vertex_t *v2);
void registerHook(Hook *hook, unsigned hook_bits);
void unregisterHook(Hook *hook);
void reset();
Hooks();
~Hooks();
};
/**
* \class Collector
* \brief Base class for objects responsible for selecting result from which form the result polyhedron.
*
*/
class Collector {
Collector(const Collector &);
Collector &operator=(const Collector &);
protected:
public:
virtual void collect(FaceLoopGroup *group, CSG::Hooks &) =0;
virtual meshset_t *done(CSG::Hooks &) =0;
Collector() {}
virtual ~Collector() {}
};
private:
typedef carve::geom::RTreeNode<3, carve::mesh::Face<3> *> face_rtree_t;
typedef std::unordered_map<carve::mesh::Face<3> *, std::vector<carve::mesh::Face<3> *> > face_pairs_t;
/// The computed intersection data.
Intersections intersections;
/// A map from intersection point to a set of intersections
/// represented by pairs of intersection objects.
VertexIntersections vertex_intersections;
/// A pool from which temporary vertices are allocated. Also
/// provides testing for pool membership.
VertexPool vertex_pool;
void init();
void makeVertexIntersections();
void groupIntersections();
void _generateVertexVertexIntersections(meshset_t::vertex_t *va,
meshset_t::edge_t *eb);
void generateVertexVertexIntersections(meshset_t::face_t *a,
const std::vector<meshset_t::face_t *> &b);
void _generateVertexEdgeIntersections(meshset_t::vertex_t *va,
meshset_t::edge_t *eb);
void generateVertexEdgeIntersections(meshset_t::face_t *a,
const std::vector<meshset_t::face_t *> &b);
void _generateEdgeEdgeIntersections(meshset_t::edge_t *ea,
meshset_t::edge_t *eb);
void generateEdgeEdgeIntersections(meshset_t::face_t *a,
const std::vector<meshset_t::face_t *> &b);
void _generateVertexFaceIntersections(meshset_t::face_t *fa,
meshset_t::edge_t *eb);
void generateVertexFaceIntersections(meshset_t::face_t *a,
const std::vector<meshset_t::face_t *> &b);
void _generateEdgeFaceIntersections(meshset_t::face_t *fa,
meshset_t::edge_t *eb);
void generateEdgeFaceIntersections(meshset_t::face_t *a,
const std::vector<meshset_t::face_t *> &b);
void generateIntersectionCandidates(meshset_t *a,
const face_rtree_t *a_node,
meshset_t *b,
const face_rtree_t *b_node,
face_pairs_t &face_pairs,
bool descend_a = true);
/**
* \brief Compute all points of intersection between poly \a a and poly \a b
*
* @param a Polyhedron a.
* @param b Polyhedron b.
*/
void generateIntersections(meshset_t *a,
const face_rtree_t *a_node,
meshset_t *b,
const face_rtree_t *b_node,
detail::Data &data);
/**
* \brief Generate tables of intersecting pairs of faces.
*
* @param[out] data Internal data-structure holding intersection info.
*/
void intersectingFacePairs(detail::Data &data);
/**
* \brief Divide edges in \a edges that are intersected by polyhedron \a poly
*
* @param edges The edges to divide.
* @param[in] poly The polyhedron to divide against.
* @param[in,out] data Intersection information.
*/
void divideEdges(
const std::vector<meshset_t::edge_t> &edges,
meshset_t *poly,
detail::Data &data);
void divideIntersectedEdges(detail::Data &data);
/**
* \brief From the intersection points of pairs of intersecting faces, compute intersection edges.
*
* @param[out] eclass Classification information about created edges.
* @param[in,out] data Intersection information.
*/
void makeFaceEdges(
EdgeClassification &eclass,
detail::Data &data);
friend void classifyEasyFaces(
FaceLoopList &face_loops,
VertexClassification &vclass,
meshset_t *other_poly,
int other_poly_num,
CSG &csg,
CSG::Collector &collector);
size_t generateFaceLoops(
meshset_t *poly,
const detail::Data &data,
FaceLoopList &face_loops_out);
// intersect_group.cpp
/**
* \brief Build a loop edge mapping from a list of face loops.
*
* @param[in] loops A list of face loops.
* @param[in] edge_count A hint as to the number of edges in \a loops.
* @param[out] edge_map The calculated map of edges to loops.
*/
void makeEdgeMap(
const FaceLoopList &loops,
size_t edge_count,
detail::LoopEdges &edge_map);
/**
* \brief Divide a list of face loops into groups that are connected by at least one edge not present in \a no_cross.
*
* @param[in] src The source mesh from which these loops derive.
* @param[in,out] face_loops The list of loops (will be emptied as a side effect)
* @param[in] loop_edges A loop edge map used for traversing connected loops.
* @param[in] no_cross A set of edges not to cross.
* @param[out] out_loops A list of grouped face loops.
*/
void groupFaceLoops(
meshset_t *src,
FaceLoopList &face_loops,
const detail::LoopEdges &loop_edges,
const V2Set &no_cross,
FLGroupList &out_loops);
/**
* \brief Find the set of edges shared between two edge maps.
*
* @param[in] edge_map_a The first edge map.
* @param[in] edge_map_b The second edge map.
* @param[out] shared_edges The resulting set of common edges.
*/
void findSharedEdges(
const detail::LoopEdges &edge_map_a,
const detail::LoopEdges &edge_map_b,
V2Set &shared_edges);
// intersect_classify_edge.cpp
/**
*
*
* @param shared_edges
* @param vclass
* @param poly_a
* @param a_loops_grouped
* @param a_edge_map
* @param poly_b
* @param b_loops_grouped
* @param b_edge_map
* @param collector
*/
void classifyFaceGroupsEdge(
const V2Set &shared_edges,
VertexClassification &vclass,
meshset_t *poly_a,
const face_rtree_t *poly_a_rtree,
FLGroupList &a_loops_grouped,
const detail::LoopEdges &a_edge_map,
meshset_t *poly_b,
const face_rtree_t *poly_b_rtree,
FLGroupList &b_loops_grouped,
const detail::LoopEdges &b_edge_map,
CSG::Collector &collector);
// intersect_classify_group.cpp
/**
*
*
* @param shared_edges
* @param vclass
* @param poly_a
* @param a_loops_grouped
* @param a_edge_map
* @param poly_b
* @param b_loops_grouped
* @param b_edge_map
* @param collector
*/
void classifyFaceGroups(
const V2Set &shared_edges,
VertexClassification &vclass,
meshset_t *poly_a,
const face_rtree_t *poly_a_rtree,
FLGroupList &a_loops_grouped,
const detail::LoopEdges &a_edge_map,
meshset_t *poly_b,
const face_rtree_t *poly_b_rtree,
FLGroupList &b_loops_grouped,
const detail::LoopEdges &b_edge_map,
CSG::Collector &collector);
// intersect_half_classify_group.cpp
/**
*
*
* @param shared_edges
* @param vclass
* @param poly_a
* @param a_loops_grouped
* @param a_edge_map
* @param poly_b
* @param b_loops_grouped
* @param b_edge_map
* @param FaceClass
* @param b_out
*/
void halfClassifyFaceGroups(
const V2Set &shared_edges,
VertexClassification &vclass,
meshset_t *poly_a,
const face_rtree_t *poly_a_rtree,
FLGroupList &a_loops_grouped,
const detail::LoopEdges &a_edge_map,
meshset_t *poly_b,
const face_rtree_t *poly_b_rtree,
FLGroupList &b_loops_grouped,
const detail::LoopEdges &b_edge_map,
std::list<std::pair<FaceClass, meshset_t *> > &b_out);
// intersect.cpp
/**
* \brief The main calculation method for CSG.
*
* @param[in] a Polyhedron a
* @param[in] b Polyhedron b
* @param[out] vclass
* @param[out] eclass
* @param[out] a_face_loops
* @param[out] b_face_loops
* @param[out] a_edge_count
* @param[out] b_edge_count
*/
void calc(
meshset_t *a,
const face_rtree_t *a_rtree,
meshset_t *b,
const face_rtree_t *b_rtree,
VertexClassification &vclass,
EdgeClassification &eclass,
FaceLoopList &a_face_loops,
FaceLoopList &b_face_loops,
size_t &a_edge_count,
size_t &b_edge_count);
public:
/**
* \enum OP
* \brief Enumeration of the supported CSG operations.
*/
enum OP {
UNION, /**< in a or b. */
INTERSECTION, /**< in a and b. */
A_MINUS_B, /**< in a, but not b. */
B_MINUS_A, /**< in b, but not a. */
SYMMETRIC_DIFFERENCE, /**< in a or b, but not both. */
ALL /**< all split faces from a and b */
};
/**
* \enum CLASSIFY_TYPE
* \brief The type of classification algorithm to use.
*/
enum CLASSIFY_TYPE {
CLASSIFY_NORMAL, /**< Normal (group) classifier. */
CLASSIFY_EDGE /**< Edge classifier. */
};
CSG::Hooks hooks; /**< The manager for calculation hooks. */
CSG();
~CSG();
/**
* \brief Compute a CSG operation between two polyhedra, \a a and \a b.
*
* @param a Polyhedron a
* @param b Polyhedron b
* @param collector The collector (determines the CSG operation performed)
* @param shared_edges A pointer to a set that will be populated with shared edges (if not NULL).
* @param classify_type The type of classifier to use.
*
* @return
*/
meshset_t *compute(
meshset_t *a,
meshset_t *b,
CSG::Collector &collector,
V2Set *shared_edges = NULL,
CLASSIFY_TYPE classify_type = CLASSIFY_NORMAL);
/**
* \brief Compute a CSG operation between two closed polyhedra, \a a and \a b.
*
* @param a Polyhedron a
* @param b Polyhedron b
* @param op The CSG operation (A collector is created automatically).
* @param shared_edges A pointer to a set that will be populated with shared edges (if not NULL).
* @param classify_type The type of classifier to use.
*
* @return
*/
meshset_t *compute(
meshset_t *a,
meshset_t *b,
OP op,
V2Set *shared_edges = NULL,
CLASSIFY_TYPE classify_type = CLASSIFY_NORMAL);
void slice(
meshset_t *a,
meshset_t *b,
std::list<meshset_t *> &a_sliced,
std::list<meshset_t *> &b_sliced,
V2Set *shared_edges = NULL);
bool sliceAndClassify(
meshset_t *closed,
meshset_t *open,
std::list<std::pair<FaceClass, meshset_t *> > &result,
V2Set *shared_edges = NULL);
};
}
}
|