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
|
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/Surface_mesh.h>
#include <CGAL/Polygon_mesh_processing/repair_polygon_soup.h>
#include <CGAL/Polygon_mesh_processing/orient_polygon_soup.h>
#include <CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h>
#include <algorithm>
#include <array>
#include <iostream>
#include <vector>
typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
typedef K::FT FT;
typedef K::Point_3 Point_3;
typedef CGAL::Surface_mesh<Point_3> Mesh;
typedef std::array<FT, 3> Custom_point;
//#define CGAL_USE_ARRAY_POLYGONS_IN_EXAMPLE
#ifdef CGAL_USE_ARRAY_POLYGONS_IN_EXAMPLE
typedef std::array<std::size_t, 3> CGAL_Polygon;
#else
typedef std::vector<std::size_t> CGAL_Polygon;
#endif
namespace PMP = CGAL::Polygon_mesh_processing;
struct Array_traits
{
struct Equal_3
{
bool operator()(const Custom_point& p, const Custom_point& q) const {
return (p == q);
}
};
struct Less_xyz_3
{
bool operator()(const Custom_point& p, const Custom_point& q) const {
return std::lexicographical_compare(p.begin(), p.end(), q.begin(), q.end());
}
};
Equal_3 equal_3_object() const { return Equal_3(); }
Less_xyz_3 less_xyz_3_object() const { return Less_xyz_3(); }
};
int main(int, char**)
{
// First, construct a polygon soup with some problems
std::vector<std::array<FT, 3> > points;
std::vector<CGAL_Polygon> polygons;
points.push_back(CGAL::make_array<FT>( 0, 0, 0)); // 0
points.push_back(CGAL::make_array<FT>( 1, 0, 0)); // 1
points.push_back(CGAL::make_array<FT>( 0, 1, 0)); // 2
points.push_back(CGAL::make_array<FT>(-1, 0, 0)); // 3
points.push_back(CGAL::make_array<FT>( 0, -1, 0)); // 4
points.push_back(CGAL::make_array<FT>( 0, 1, 0)); // 5 -- duplicate point with 2
points.push_back(CGAL::make_array<FT>( 0, -2, 0)); // 6 -- unused point
// normal face
polygons.push_back({0,1,2});
// degenerate face
polygons.push_back({0,0,0});
// duplicate faces with different orientations
polygons.push_back({0,1,4});
polygons.push_back({0,4,1});
// normal face
polygons.push_back({0,3,5});
// degenerate face
polygons.push_back({0,3,0});
// normal face
polygons.push_back({0,3,4});
#ifndef CGAL_USE_ARRAY_POLYGONS_IN_EXAMPLE
// pinched and degenerate face
polygons.push_back({0,1,2,3,4,3,2,1});
#endif
std::cout << "Before repairing, the soup has " << points.size() << " vertices and " << polygons.size() << " faces" << std::endl;
PMP::repair_polygon_soup(points, polygons, CGAL::parameters::geom_traits(Array_traits()));
std::cout << "After repairing, the soup has " << points.size() << " vertices and " << polygons.size() << " faces" << std::endl;
Mesh mesh;
PMP::orient_polygon_soup(points, polygons);
PMP::polygon_soup_to_polygon_mesh(points, polygons, mesh);
std::cout << "Mesh has " << num_vertices(mesh) << " vertices and " << num_faces(mesh) << " faces" << std::endl;
assert(num_vertices(mesh) == 5);
assert(num_faces(mesh) == 4);
return 0;
}
|
