// Copyright (c) 2015 Geometry Factory // All rights reserved. // // This file is part of CGAL (www.cgal.org) // // $URL$ // $Id$ // SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial // // Author(s) : Simon Giraudot #ifndef CGAL_IO_PLY_H #define CGAL_IO_PLY_H #include #include #include #include #include namespace CGAL { //////////////////////////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////////////////////////// /// Read //HEdgesRange" = range of std::pair //HUVRange = range of std::pair template bool read_PLY(std::istream& is, PointRange& points, PolygonRange& polygons, HEdgesOutputIterator hedges_out, ColorOutputIterator fc_out, ColorOutputIterator vc_out, HUVOutputIterator huvs_out, bool /* verbose */ = false, typename std::enable_if< CGAL::is_iterator::value >::type* =0) { typedef typename PointRange::value_type Point_3; typedef CGAL::Color Color_rgb; if(!is.good()) { std::cerr << "Error: cannot open file" << std::endl; return false; } IO::internal::PLY_reader reader; if(!(reader.init(is))) { is.setstate(std::ios::failbit); return false; } for(std::size_t i = 0; i < reader.number_of_elements(); ++ i) { IO::internal::PLY_element& element = reader.element(i); if(element.name() == "vertex" || element.name() == "vertices") { bool has_colors = false; std::string rtag = "r", gtag = "g", btag = "b"; if((element.has_property("red") || element.has_property("r")) && (element.has_property("green") || element.has_property("g")) && (element.has_property("blue") || element.has_property("b"))) { has_colors = true; if(element.has_property("red")) { rtag = "red"; gtag = "green"; btag = "blue"; } } for(std::size_t j = 0; j < element.number_of_items(); ++ j) { for(std::size_t k = 0; k < element.number_of_properties(); ++ k) { IO::internal::PLY_read_number* property = element.property(k); property->get(is); if(is.fail()) return false; } std::tuple new_vertex; if(has_colors) { IO::internal::process_properties(element, new_vertex, make_ply_point_reader(CGAL::make_nth_of_tuple_property_map<0>(new_vertex)), std::make_pair(CGAL::make_nth_of_tuple_property_map<1>(new_vertex), PLY_property(rtag.c_str())), std::make_pair(CGAL::make_nth_of_tuple_property_map<2>(new_vertex), PLY_property(gtag.c_str())), std::make_pair(CGAL::make_nth_of_tuple_property_map<3>(new_vertex), PLY_property(btag.c_str()))); *vc_out++ = Color_rgb(get<1>(new_vertex), get<2>(new_vertex), get<3>(new_vertex)); } else IO::internal::process_properties(element, new_vertex, make_ply_point_reader(CGAL::make_nth_of_tuple_property_map<0>(new_vertex))); points.push_back(get<0>(new_vertex)); } } else if(element.name() == "face" || element.name() == "faces") { if(element.has_property >("vertex_indices")) IO::internal::read_PLY_faces(is, element, polygons, fc_out, "vertex_indices"); else if(element.has_property >("vertex_indices")) IO::internal::read_PLY_faces(is, element, polygons, fc_out, "vertex_indices"); else if(element.has_property >("vertex_index")) IO::internal::read_PLY_faces(is, element, polygons, fc_out, "vertex_index"); else if(element.has_property >("vertex_index")) IO::internal::read_PLY_faces(is, element, polygons, fc_out, "vertex_index"); else { std::cerr << "Error: can't find vertex indices in PLY input" << std::endl; return false; } } else if(element.name() == "halfedge" ) { bool has_uv = false; std::string stag = "source", ttag = "target", utag = "u", vtag = "v"; if( element.has_property("source") && element.has_property("target") && element.has_property("u") && element.has_property("v")) { has_uv = true; } cpp11::tuple new_hedge; for(std::size_t j = 0; j < element.number_of_items(); ++ j) { for(std::size_t k = 0; k < element.number_of_properties(); ++ k) { IO::internal::PLY_read_number* property = element.property(k); property->get(is); if(is.fail()) return false; } if(has_uv) { IO::internal::process_properties(element, new_hedge, std::make_pair(CGAL::make_nth_of_tuple_property_map<0>(new_hedge), PLY_property(stag.c_str())), std::make_pair(CGAL::make_nth_of_tuple_property_map<1>(new_hedge), PLY_property(ttag.c_str())), std::make_pair(CGAL::make_nth_of_tuple_property_map<2>(new_hedge), PLY_property(utag.c_str())), std::make_pair(CGAL::make_nth_of_tuple_property_map<3>(new_hedge), PLY_property(vtag.c_str()))); *hedges_out++ = std::make_pair(get<0>(new_hedge), get<1>(new_hedge)); *huvs_out++ = std::make_pair(get<2>(new_hedge), get<3>(new_hedge)); } else { IO::internal::process_properties(element, new_hedge, std::make_pair(CGAL::make_nth_of_tuple_property_map<0>(new_hedge), PLY_property(stag.c_str())), std::make_pair(CGAL::make_nth_of_tuple_property_map<1>(new_hedge), PLY_property(ttag.c_str())) ); } } } else // Read other elements and ignore { for(std::size_t j = 0; j < element.number_of_items(); ++ j) { for(std::size_t k = 0; k < element.number_of_properties(); ++ k) { IO::internal::PLY_read_number* property = element.property(k); property->get(is); if(is.fail()) return false; } } } } return !is.fail(); } template bool read_PLY(std::istream& is, PointRange& points, PolygonRange& polygons, HEdgesRange& hedges, ColorRange& fcolors, ColorRange& vcolors, HUVRange& huvs, bool /* verbose */ = false, typename std::enable_if< !CGAL::is_iterator::value >::type* =0) { return read_PLY(is, points, polygons, std::back_inserter(hedges), std::back_inserter(fcolors), std::back_inserter(vcolors), std::back_inserter(huvs)); } template bool read_PLY(std::istream& is, PointRange& points, PolygonRange& polygons, ColorRange& fcolors, ColorRange& vcolors, bool /* verbose */ = false) { std::vector > dummy_pui; std::vector > dummy_pf; return read_PLY(is, points, polygons, dummy_pui, std::back_inserter(fcolors), std::back_inserter(vcolors), dummy_pf); } /*! * \ingroup IOstreamFunctions * * reads the content of `is` into `points` and `polygons`, in the PLY format. * * `PointRange` is a model of the concepts `RandomAccessContainer` * and `BackInsertionSequence` whose `value type` is a `CGAL::Point_3`. * * `PolygonRange` is a model of the concepts `RandomAccessContainer` * and `BackInsertionSequence` whose `value type` is `std::size_t`. * * \see \ref IOStreamPLY */ template bool read_PLY(std::istream& is, PointRange& points, PolygonRange& polygons, bool /* verbose */ = false) { typedef typename PointRange::value_type Point_3; if(!is.good()) { std::cerr << "Error: cannot open file" << std::endl; return false; } IO::internal::PLY_reader reader; if(!(reader.init(is))) { is.setstate(std::ios::failbit); return false; } for(std::size_t i = 0; i < reader.number_of_elements(); ++ i) { IO::internal::PLY_element& element = reader.element(i); if(element.name() == "vertex" || element.name() == "vertices") { for(std::size_t j = 0; j < element.number_of_items(); ++ j) { for(std::size_t k = 0; k < element.number_of_properties(); ++ k) { IO::internal::PLY_read_number* property = element.property(k); property->get(is); if(is.fail()) return false; } Point_3 new_vertex; IO::internal::process_properties(element, new_vertex, make_ply_point_reader(CGAL::Identity_property_map())); points.push_back(new_vertex); } } else if(element.name() == "face" || element.name() == "faces") { std::vector dummy; if(element.has_property >("vertex_indices")) IO::internal::read_PLY_faces(is, element, polygons, dummy, "vertex_indices"); else if(element.has_property >("vertex_indices")) IO::internal::read_PLY_faces(is, element, polygons, dummy, "vertex_indices"); else if(element.has_property >("vertex_index")) IO::internal::read_PLY_faces(is, element, polygons, dummy, "vertex_index"); else if(element.has_property >("vertex_index")) IO::internal::read_PLY_faces(is, element, polygons, dummy, "vertex_index"); else { std::cerr << "Error: can't find vertex indices in PLY input" << std::endl; return false; } } else // Read other elements and ignore { for(std::size_t j = 0; j < element.number_of_items(); ++ j) { for(std::size_t k = 0; k < element.number_of_properties(); ++ k) { IO::internal::PLY_read_number* property = element.property(k); property->get(is); if(is.fail()) return false; } } } } return !is.fail(); } template bool read_PLY(std::istream& is, PointRange& points, PolygonRange& polygons, const NamedParameters& np) { using parameters::choose_parameter; using parameters::get_parameter; std::vector > dummy_pui; std::vector > dummy_pf; return read_PLY(is, points, polygons,std::back_inserter(dummy_pui), choose_parameter(get_parameter(np, internal_np::face_color_output_iterator), CGAL::Emptyset_iterator()), choose_parameter(get_parameter(np, internal_np::vertex_color_output_iterator), CGAL::Emptyset_iterator()), std::back_inserter(dummy_pf)); } //////////////////////////////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////////////////////////////// /// Write /*! * \ingroup IOstreamFunctions * * writes the content of `points` and `polygons` in `out`, in the OFF format. * * `PointRange` is a model of the concepts `RandomAccessContainer` * and `BackInsertionSequence` whose `value type` is a `CGAL::Point_3`. * * `PolygonRange` is a model of the concepts `RandomAccessContainer` * and `BackInsertionSequence` whose `value type` is `std::size_t`. * \see \ref IOStreamOFF */ template bool write_PLY(std::ostream& out, const PointRange& points, const PolygonRange& polygons #ifndef DOXYGEN_RUNNING ,typename boost::enable_if< typename boost::has_range_const_iterator::type >::type* =0 #endif ) { typedef typename PointRange::value_type Point_3; typedef typename PolygonRange::value_type Polygon_3; if(!out.good()) { std::cerr << "Error: cannot open file" << std::endl; return false; } // Write header out << "ply" << std::endl << ((get_mode(out) == IO::BINARY) ? "format binary_little_endian 1.0" : "format ascii 1.0") << std::endl << "comment Generated by the CGAL library" << std::endl << "element vertex " << points.size() << std::endl; IO::internal::output_property_header(out, make_ply_point_writer (CGAL::Identity_property_map())); out << "element face " << polygons.size() << std::endl; IO::internal::output_property_header(out, std::make_pair(CGAL::Identity_property_map(), PLY_property >("vertex_indices"))); out << "end_header" << std::endl; for (std::size_t i = 0; i < points.size(); ++ i) IO::internal::output_properties(out, points.begin() + i, make_ply_point_writer (CGAL::Identity_property_map())); for (std::size_t i = 0; i < polygons.size(); ++ i) IO::internal::output_properties(out, polygons.begin() + i, std::make_pair(CGAL::Identity_property_map(), PLY_property >("vertex_indices"))); return out.good(); } } // namespace CGAL #endif // CGAL_IO_PLY_H