songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Better --debug_input_faces (dump polygon files)

This commit is contained in:
Laurent Rineau 2024-11-22 17:41:40 +01:00
parent 635e852104
commit 6ec771816e
1 changed files with 9 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
Constrained_triangulation_3/include/CGAL/Conforming_constrained_Delaunay_triangulation_3.h
View File

@ -1555,9 +1555,6 @@ public:
private: private:
void fill_cdt_2(CDT_2& cdt_2, CDT_3_face_index polygon_contraint_id) void fill_cdt_2(CDT_2& cdt_2, CDT_3_face_index polygon_contraint_id)
{ {
if(this->debug_input_faces()) {
std::cerr << "Polygon #" << polygon_contraint_id << " normal is: " << cdt_2.geom_traits().normal() << '\n';
}
const auto vec_of_handles = std::invoke([this, polygon_contraint_id]() { const auto vec_of_handles = std::invoke([this, polygon_contraint_id]() {
std::vector<std::vector<Vertex_handle>> vec_of_handles; std::vector<std::vector<Vertex_handle>> vec_of_handles;
for(const auto& border : this->face_borders[polygon_contraint_id]) { for(const auto& border : this->face_borders[polygon_contraint_id]) {
@ -1587,11 +1584,17 @@ private:
}); });
if(this->debug_input_faces()) { if(this->debug_input_faces()) {
std::cerr << " points\n"; std::cerr << "Polygon #" << polygon_contraint_id << " normal is: " << cdt_2.geom_traits().normal() << '\n';
auto filename = "dump_cdt_2_polygons_" + std::to_string(polygon_contraint_id) + ".polylines.txt";
std::cerr << " dumping it to \"" << filename << "\".\n";
std::ofstream out(filename);
out.precision(17);
for(const auto& handles : vec_of_handles) { for(const auto& handles : vec_of_handles) {
for(auto it = handles.begin(), end = std::prev(handles.end()); it != end; ++it) { out << handles.size() << " ";
std::cerr << " " << tr().point(*it) << '\n'; for(auto it = handles.begin(), end = handles.end(); it != end; ++it) {
out << " " << tr().point(*it);
} }
out << " " << tr().point(handles.front()) << '\n';
} }
} }
// create and fill the 2D triangulation // create and fill the 2D triangulation