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
|
/* This file is part of the Gudhi Library. The Gudhi library
* (Geometric Understanding in Higher Dimensions) is a generic C++
* library for computational topology.
*
* Author(s): Vincent Rouvreau
*
* Copyright (C) 2015 INRIA Saclay (France)
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef SRC_ALPHA_SHAPES_INCLUDE_GUDHI_ALPHA_SHAPES_DELAUNAY_TRIANGULATION_OFF_IO_H_
#define SRC_ALPHA_SHAPES_INCLUDE_GUDHI_ALPHA_SHAPES_DELAUNAY_TRIANGULATION_OFF_IO_H_
#include <string>
#include <vector>
#include <fstream>
#include "gudhi/Off_reader.h"
namespace Gudhi {
namespace alphashapes {
/**
*@brief Off reader visitor with flag that can be passed to Off_reader to read a Delaunay_triangulation_complex.
*/
template<typename Complex>
class Delaunay_triangulation_off_flag_visitor_reader {
Complex& complex_;
typedef typename Complex::Point Point;
const bool load_only_points_;
public:
explicit Delaunay_triangulation_off_flag_visitor_reader(Complex& complex, bool load_only_points = false) :
complex_(complex),
load_only_points_(load_only_points) { }
void init(int dim, int num_vertices, int num_faces, int num_edges) {
#ifdef DEBUG_TRACES
std::cout << "init" << std::endl;
#endif // DEBUG_TRACES
}
void point(const std::vector<double>& point) {
#ifdef DEBUG_TRACES
std::cout << "p ";
for (auto coordinate: point) {
std::cout << coordinate << " | ";
}
std::cout << std::endl;
#endif // DEBUG_TRACES
complex_.insert(Point(point.size(), point.begin(), point.end()));
}
void maximal_face(const std::vector<int>& face) {
// For alpha shapes, only points are read
}
void done() {
#ifdef DEBUG_TRACES
std::cout << "done" << std::endl;
#endif // DEBUG_TRACES
}
};
/**
*@brief Off reader visitor that can be passed to Off_reader to read a Delaunay_triangulation_complex.
*/
template<typename Complex>
class Delaunay_triangulation_off_visitor_reader {
Complex& complex_;
// typedef typename Complex::Vertex_handle Vertex_handle;
// typedef typename Complex::Simplex_handle Simplex_handle;
typedef typename Complex::Point Point;
const bool load_only_points_;
std::vector<Point> points_;
// std::vector<Simplex_handle> maximal_faces_;
public:
explicit Delaunay_triangulation_off_visitor_reader(Complex& complex, bool load_only_points = false) :
complex_(complex),
load_only_points_(load_only_points) { }
void init(int dim, int num_vertices, int num_faces, int num_edges) {
#ifdef DEBUG_TRACES
std::cout << "init - " << num_vertices << std::endl;
#endif // DEBUG_TRACES
// maximal_faces_.reserve(num_faces);
points_.reserve(num_vertices);
}
void point(const std::vector<double>& point) {
#ifdef DEBUG_TRACES
std::cout << "p ";
for (auto coordinate: point) {
std::cout << coordinate << " | ";
}
std::cout << std::endl;
#endif // DEBUG_TRACES
points_.emplace_back(Point(point.size(), point.begin(), point.end()));
}
void maximal_face(const std::vector<int>& face) {
// For alpha shapes, only points are read
}
void done() {
complex_.insert(points_.begin(), points_.end());
#ifdef DEBUG_TRACES
std::cout << "done" << std::endl;
#endif // DEBUG_TRACES
}
};
/**
*@brief Class that allows to load a Delaunay_triangulation_complex from an off file.
*/
template<typename Complex>
class Delaunay_triangulation_off_reader {
public:
/**
* name_file : file to read
* read_complex : complex that will receive the file content
* read_only_points : specify true if only the points must be read
*/
Delaunay_triangulation_off_reader(const std::string & name_file, Complex& read_complex, bool read_only_points = false,
bool is_flag = false) : valid_(false) {
std::ifstream stream(name_file);
if (stream.is_open()) {
if (is_flag) {
// For alpha shapes, only points are read
Delaunay_triangulation_off_flag_visitor_reader<Complex> off_visitor(read_complex, true);
Off_reader off_reader(stream);
valid_ = off_reader.read(off_visitor);
} else {
// For alpha shapes, only points are read
Delaunay_triangulation_off_visitor_reader<Complex> off_visitor(read_complex, true);
Off_reader off_reader(stream);
valid_ = off_reader.read(off_visitor);
}
}
}
/**
* return true if reading did not meet problems.
*/
bool is_valid() const {
return valid_;
}
private:
bool valid_;
};
template<typename Complex>
class Delaunay_triangulation_off_writer {
public:
/**
* name_file : file where the off will be written
* save_complex : complex that be outputted in the file
* for now only save triangles.
*/
Delaunay_triangulation_off_writer(const std::string & name_file, const Complex& save_complex) {
std::ofstream stream(name_file);
if (stream.is_open()) {
// OFF header
stream << "OFF" << std::endl;
// no endl on next line - don't know why...
stream << save_complex.number_of_vertices() << " " << save_complex.number_of_finite_full_cells() << " 0";
// Points list
for (auto vit = save_complex.vertices_begin(); vit != save_complex.vertices_end(); ++vit) {
for (auto Coord = vit->point().cartesian_begin(); Coord != vit->point().cartesian_end(); ++Coord) {
stream << *Coord << " ";
}
stream << std::endl;
}
// Finite cells list
for (auto cit = save_complex.finite_full_cells_begin(); cit != save_complex.finite_full_cells_end(); ++cit) {
stream << std::distance(cit->vertices_begin(), cit->vertices_end()) << " "; // Dimension
for (auto vit = cit->vertices_begin(); vit != cit->vertices_end(); ++vit) {
auto vertexHdl = *vit;
// auto vertexHdl = std::distance(save_complex.vertices_begin(), *vit) - 1;
// stream << std::distance(save_complex.vertices_begin(), *(vit)) - 1 << " ";
}
stream << std::endl;
}
stream.close();
} else {
std::cerr << "could not open file " << name_file << std::endl;
}
}
};
} // namespace alphashapes
} // namespace Gudhi
#endif // SRC_ALPHA_SHAPES_INCLUDE_GUDHI_ALPHA_SHAPES_DELAUNAY_TRIANGULATION_OFF_IO_H_
|
