// Copyright (c) 2009 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/Periodic_3_triangulation_3/include/CGAL/periodic_3_triangulation_3_io.h $ // $Id: periodic_3_triangulation_3_io.h 254d60f 2019-10-19T15:23:19+02:00 Sébastien Loriot // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // // Author(s) : Manuel Caroli #ifndef CGAL_PERIODIC_3_TRIANGULATION_3_IO_H #define CGAL_PERIODIC_3_TRIANGULATION_3_IO_H #include #include #include #include namespace CGAL { template Stream &write_triangulation_to_off(Stream &out, Triangulation &t) { typedef typename Triangulation::Point Point; typedef typename Triangulation::Iso_cuboid Iso_cuboid; typedef typename Triangulation::Triangulation_data_structure::size_type size_type; size_type number_of_cells = t.tds().number_of_cells(); out << "OFF " << "\n" << 4*number_of_cells + 8 << " " << 4*number_of_cells + 6 << " " << 0 << std::endl; Iso_cuboid cb = t.domain(); out << cb.xmin() << " " << cb.ymin() << " " << cb.zmax() << std::endl; out << cb.xmax() << " " << cb.ymin() << " " << cb.zmax() << std::endl; out << cb.xmin() << " " << cb.ymax() << " " << cb.zmax() << std::endl; out << cb.xmax() << " " << cb.ymax() << " " << cb.zmax() << std::endl; out << cb.xmin() << " " << cb.ymax() << " " << cb.zmin() << std::endl; out << cb.xmax() << " " << cb.ymax() << " " << cb.zmin() << std::endl; out << cb.xmin() << " " << cb.ymin() << " " << cb.zmin() << std::endl; out << cb.xmax() << " " << cb.ymin() << " " << cb.zmin() << std::endl; if (t.number_of_sheets() == CGAL::make_array(1,1,1)) { for (typename Triangulation::Cell_iterator it = t.cells_begin(); it != t.cells_end(); it++) { for (int i=0; i<4; i++) { Point p = t.point(t.periodic_point(it,i)); out << p.x() << " " << p.y() << " " << p.z() << std::endl; } } } else { for (typename Triangulation::Cell_iterator it = t.cells_begin(); it != t.cells_end(); it++) { for (int i=0; i<4; i++) { typename Triangulation::Vertex_handle vh; typename Triangulation::Offset off; t.get_vertex(it, i, vh, off); Point p = t.point(t.periodic_point(it, i)); out << p.x() << " " << p.y() << " " << p.z() << std::endl; } } } out << "4 0 1 3 2" << std::endl; out << "4 2 3 5 4" << std::endl; out << "4 4 5 7 6" << std::endl; out << "4 6 7 1 0" << std::endl; out << "4 1 7 5 3" << std::endl; out << "4 6 0 2 4" << std::endl; for (size_type i=0; i Stream &write_cells_to_off(Stream &out, Triangulation &t, int number_of_cells, Cell_iterator cit, Cell_iterator cells_end) { typedef typename Triangulation::Point Point; out << "OFF " << "\n" << 4*number_of_cells << " " << 4*number_of_cells << " " << 0 << std::endl; while (cit != cells_end) { for (int i=0; i<4; i++) { Point p = t.get_point(*cit,i); out << p.x() << " " << p.y() << " " << p.z() << std::endl; } ++cit; } for (int i=0; i Stream& draw_dual_to_off(Stream &os, Triangulation &t) { os << "OFF " << "\n" << 2*t.number_of_facets() << " " << t.number_of_facets() << " 0" << std::endl; t.draw_dual(os); for(unsigned int i=0; i < t.number_of_facets(); i++) { os << "3 " << i*2 << " " << i*2+1 << " " << i*2 << std::endl; } return os; } } // namespace CGAL #endif //CGAL_PERIODIC_3_TRIANGULATION_3_IO_H