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
|
// Copyright (c) 2012-2013, IGN France.
// Copyright (c) 2012-2024, Oslandia.
// Copyright (c) 2024-2025, SFCGAL team.
// SPDX-License-Identifier: LGPL-2.0-or-later
#include <fstream>
#include "SFCGAL/GeometryCollection.h"
#include "SFCGAL/LineString.h"
#include "SFCGAL/MultiLineString.h"
#include "SFCGAL/MultiPoint.h"
#include "SFCGAL/MultiPolygon.h"
#include "SFCGAL/MultiSolid.h"
#include "SFCGAL/Point.h"
#include "SFCGAL/Polygon.h"
#include "SFCGAL/PolyhedralSurface.h"
#include "SFCGAL/Solid.h"
#include "SFCGAL/Triangle.h"
#include "SFCGAL/TriangulatedSurface.h"
#include "SFCGAL/detail/generator/disc.h"
#include "SFCGAL/detail/generator/hoch.h"
#include "SFCGAL/io/wkt.h"
#include "SFCGAL/triangulate/triangulate2DZ.h"
#include "SFCGAL/triangulate/triangulatePolygon.h"
#include "../test_config.h"
#include "Bench.h"
#include <boost/format.hpp>
#include <boost/test/unit_test.hpp>
#include <CGAL/point_generators_2.h>
using namespace boost::unit_test;
using namespace SFCGAL;
using namespace SFCGAL::triangulate;
#define N_POINTS 100000
typedef CGAL::Creator_uniform_2<double, Kernel::Point_2> Creator;
BOOST_AUTO_TEST_SUITE(SFCGAL_BenchTriangulation)
BOOST_AUTO_TEST_CASE(testMultiPointTriangulation)
{
CGAL::Random_points_in_disc_2<Kernel::Point_2, Creator> g(150.0);
MultiPoint multiPoint;
for (int i = 0; i < N_POINTS; i++) {
Kernel::Point_2 p = *(++g);
multiPoint.addGeometry(new Point(p));
}
bench().start(boost::format("triangulate2DZ %s points") % N_POINTS);
ConstraintDelaunayTriangulation cdt = triangulate2DZ(multiPoint);
bench().stop();
}
BOOST_AUTO_TEST_CASE(testPolygonTriangulationHoch)
{
const int N = 7;
std::unique_ptr<Polygon> fractal(generator::hoch(N));
BOOST_CHECK_EQUAL(fractal->exteriorRing().numPoints(), 49153U);
bench().start(boost::format("triangulate hoch(%s)") % N);
TriangulatedSurface triangulatedSurface;
SFCGAL::triangulate::triangulatePolygon3D(*fractal, triangulatedSurface);
bench().stop();
}
BOOST_AUTO_TEST_CASE(testPolygonTriangulationHoch_roundingSixDecimal)
{
const int N = 7;
std::unique_ptr<Polygon> fractal(generator::hoch(N));
BOOST_CHECK_EQUAL(fractal->exteriorRing().numPoints(), 49153U);
fractal->round(100000);
bench().start(boost::format("triangulate hoch(%s) (round 6 six decimals)") %
N);
TriangulatedSurface triangulatedSurface;
SFCGAL::triangulate::triangulatePolygon3D(*fractal, triangulatedSurface);
bench().stop();
}
BOOST_AUTO_TEST_CASE(testPolygonTriangulationDisc)
{
const int N = 20000;
std::unique_ptr<Polygon> disc(generator::disc(Point(0.0, 0.0), 1.0, 8U));
// std::cout << fractal->asText(5) << std::endl ;
bench().start(boost::format("triangulate disc x %s") % N);
for (int i = 0; i < N; i++) {
TriangulatedSurface triangulatedSurface;
SFCGAL::triangulate::triangulatePolygon3D(*disc, triangulatedSurface);
}
bench().stop();
}
BOOST_AUTO_TEST_CASE(testMultiPointTriangulation2D)
{
CGAL::Random_points_in_disc_2<Kernel::Point_2, Creator> g(150.0);
MultiPoint multiPoint;
for (int i = 0; i < N_POINTS; i++) {
Kernel::Point_2 p = *(++g);
multiPoint.addGeometry(new Point(p));
}
bench().start(boost::format("triangulate2D %s points") % N_POINTS);
SFCGAL::triangulate::ConstraintDelaunayTriangulation cdt;
SFCGAL::triangulate::triangulate2DZ(multiPoint, cdt);
bench().stop();
}
BOOST_AUTO_TEST_CASE(testPolygonTriangulationHoch2D)
{
const int N = 7;
std::unique_ptr<Polygon> fractal(generator::hoch(N));
// std::cout << fractal->asText(5) << std::endl ;
bench().start(boost::format("triangulate2D hoch(%s)") % N);
SFCGAL::triangulate::ConstraintDelaunayTriangulation cdt;
SFCGAL::triangulate::triangulate2DZ(*fractal, cdt);
bench().stop();
}
BOOST_AUTO_TEST_CASE(testPolygonTriangulationDisc2D)
{
const int N = 20000;
std::unique_ptr<Polygon> disc(generator::disc(Point(0.0, 0.0), 1.0, 8U));
// std::cout << fractal->asText(5) << std::endl ;
bench().start(boost::format("triangulate2D disc x %s") % N);
for (int i = 0; i < N; i++) {
SFCGAL::triangulate::ConstraintDelaunayTriangulation cdt;
SFCGAL::triangulate::triangulate2DZ(*disc, cdt);
}
bench().stop();
}
BOOST_AUTO_TEST_CASE(testPolygonTriangulationDisc2D_roundingSixDecimal)
{
const int N = 20000;
std::unique_ptr<Polygon> disc(generator::disc(Point(0.0, 0.0), 1.0, 8U));
disc->round(100000);
bench().start(
boost::format("triangulate2D disc x %s (round 6 six decimals)") % N);
for (int i = 0; i < N; i++) {
SFCGAL::triangulate::ConstraintDelaunayTriangulation cdt;
SFCGAL::triangulate::triangulate2DZ(*disc, cdt);
}
bench().stop();
}
BOOST_AUTO_TEST_SUITE_END()
|
