// Copyright (c) 2014 INRIA Sophia-Antipolis (France). // All rights reserved. // // This file is part of CGAL (www.cgal.org) // // $URL: https://github.com/CGAL/cgal/blob/v5.2/Triangulation_3/include/CGAL/IO/Triangulation_off_ostream_3.h $ // $Id: Triangulation_off_ostream_3.h 0779373 2020-03-26T13:31:46+01:00 Sébastien Loriot // SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial // // Author(s) : Clement Jamin #ifndef CGAL_TRIANGULATION_OFF_OSTREAM_3_H #define CGAL_TRIANGULATION_OFF_OSTREAM_3_H #include #include #include namespace CGAL { template < class GT, class TDS > std::ostream & export_triangulation_3_to_off(std::ostream & os, const Triangulation_3 & tr, bool export_surface_only = false) { typedef Triangulation_3 Tr; typedef typename Tr::Vertex_handle Vertex_handle; typedef typename Tr::Finite_vertices_iterator Finite_vertex_iterator; typedef typename Tr::All_cells_iterator Cells_iterator; typedef typename Tr::Finite_cells_iterator Finite_cells_iterator; size_t n = tr.number_of_vertices(); std::stringstream output; // write the vertices std::map index_of_vertex; std::size_t i = 0; for(Finite_vertex_iterator it = tr.finite_vertices_begin(); it != tr.finite_vertices_end(); ++it, ++i) { output << it->point().x() << " " << it->point().y() << " " << it->point().z() << std::endl; index_of_vertex[it.base()] = i; } CGAL_assertion( i == n ); size_t number_of_triangles = 0; if (export_surface_only) { for (Cells_iterator cit = tr.cells_begin() ; cit != tr.cells_end() ; ++cit) { if (tr.is_infinite(cit)) { output << "3 "; for (int i = 0 ; i < 4 ; ++i) { if (!tr.is_infinite(cit->vertex(i))) output << index_of_vertex[cit->vertex(i)] << " "; } output << std::endl; ++number_of_triangles; } } } else { for (Finite_cells_iterator cit = tr.finite_cells_begin() ; cit != tr.finite_cells_end() ; ++cit) { output << "3 " << index_of_vertex[cit->vertex(0)] << " " << index_of_vertex[cit->vertex(1)] << " " << index_of_vertex[cit->vertex(2)] << std::endl; output << "3 " << index_of_vertex[cit->vertex(0)] << " " << index_of_vertex[cit->vertex(2)] << " " << index_of_vertex[cit->vertex(3)] << std::endl; output << "3 " << index_of_vertex[cit->vertex(1)] << " " << index_of_vertex[cit->vertex(2)] << " " << index_of_vertex[cit->vertex(3)] << std::endl; output << "3 " << index_of_vertex[cit->vertex(0)] << " " << index_of_vertex[cit->vertex(1)] << " " << index_of_vertex[cit->vertex(3)] << std::endl; number_of_triangles += 4; } } os << "OFF \n" << n << " " << number_of_triangles << " 0\n" << output.str(); return os; } } //namespace CGAL #endif // CGAL_TRIANGULATION_OFF_OSTREAM_3_H