dust3d/thirdparty/cgal/CGAL-5.1/include/CGAL/IO/OFF_reader.h

159 lines
4.3 KiB
C
Raw Normal View History

// Copyright (c) 2015 GeometryFactory
//
2020-10-13 12:44:25 +00:00
// This file is part of CGAL (www.cgal.org)
//
2020-10-13 12:44:25 +00:00
// $URL: https://github.com/CGAL/cgal/blob/v5.1/Polyhedron_IO/include/CGAL/IO/OFF_reader.h $
// $Id: OFF_reader.h 922b861 2020-04-14T15:40:38+02:00 Sébastien Loriot
// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
//
// Author(s) : Laurent Rineau and Sebastien Loriot
#ifndef CGAL_IO_OFF_READER_H
#define CGAL_IO_OFF_READER_H
#include <CGAL/IO/File_scanner_OFF.h>
2020-10-13 12:44:25 +00:00
#include <CGAL/IO/reader_helpers.h>
#include <CGAL/array.h>
#include <CGAL/assertions.h>
2020-10-13 12:44:25 +00:00
#include <CGAL/Container_helper.h>
#include <CGAL/use.h>
2020-10-13 12:44:25 +00:00
#include <vector>
#include <iostream>
2020-10-13 12:44:25 +00:00
namespace CGAL {
template <class Point_3, class Polygon_3>
bool
read_OFF( std::istream& in,
std::vector< Point_3 >& points,
std::vector< Polygon_3 >& polygons,
bool /* verbose */ = false)
{
CGAL::File_scanner_OFF scanner(in);
points.resize(scanner.size_of_vertices());
polygons.resize(scanner.size_of_facets());
for (std::size_t i = 0; i < scanner.size_of_vertices(); ++i) {
double x, y, z, w;
scanner.scan_vertex( x, y, z, w);
CGAL_assertion(w!=0);
2020-10-13 12:44:25 +00:00
IO::internal::fill_point( x/w, y/w, z/w, points[i] );
scanner.skip_to_next_vertex( i);
}
if(!in)
return false;
for (std::size_t i = 0; i < scanner.size_of_facets(); ++i) {
std::size_t no;
scanner.scan_facet( no, i);
2020-10-13 12:44:25 +00:00
CGAL::internal::resize(polygons[i], no);
for(std::size_t j = 0; j < no; ++j) {
std::size_t id;
scanner.scan_facet_vertex_index(id, i);
if(id < scanner.size_of_vertices())
{
2020-10-13 12:44:25 +00:00
polygons[i][j] = typename std::remove_cv<typename std::iterator_traits<typename Polygon_3::const_iterator>::value_type>::type(id);
}
else
return false;
}
}
return in.good();
}
template <class Point_3, class Polygon_3, class Color_rgb >
bool
read_OFF( std::istream& in,
std::vector< Point_3 >& points,
std::vector< Polygon_3 >& polygons,
std::vector<Color_rgb>& fcolors,
std::vector<Color_rgb>& vcolors,
bool /* verbose */ = false)
{
CGAL::File_scanner_OFF scanner(in);
points.resize(scanner.size_of_vertices());
polygons.resize(scanner.size_of_facets());
if(scanner.has_colors())
vcolors.resize(scanner.size_of_vertices());
2020-10-13 12:44:25 +00:00
bool vcolored = false;
for (std::size_t i = 0; i < scanner.size_of_vertices(); ++i) {
double x, y, z, w;
scanner.scan_vertex( x, y, z, w);
CGAL_assertion(w!=0);
2020-10-13 12:44:25 +00:00
IO::internal::fill_point( x/w, y/w, z/w, points[i] );
if(i == 0)
{
2020-10-13 12:44:25 +00:00
std::string col;
char ci;
std::getline(in, col);
std::istringstream iss(col);
if(iss >> ci){
std::istringstream iss2(col);
vcolors[i] = scanner.get_color_from_line(iss2);
vcolored = true;
}
}
else
2020-10-13 12:44:25 +00:00
{
if(vcolored){
//stores the RGB value
std::string col;
std::getline(in, col);
std::istringstream iss(col);
vcolors[i] = scanner.get_color_from_line(iss);
}
}
if(!in)
return false;
}
bool has_fcolors = false;
for (std::size_t i = 0; i < scanner.size_of_facets(); ++i) {
std::size_t no;
scanner.scan_facet( no, i);
2020-10-13 12:44:25 +00:00
if(!in)
return false;
CGAL::internal::resize(polygons[i], no);
for(std::size_t j = 0; j < no; ++j) {
std::size_t id;
scanner.scan_facet_vertex_index(id, i);
if(id < scanner.size_of_vertices())
{
polygons[i][j] = id;
}
else
{
return false;
}
}
if(i==0)
{
std::string col;
std::getline(in, col);
std::istringstream iss(col);
char ci =' ';
if(iss >> ci){
has_fcolors = true;
fcolors.resize(scanner.size_of_facets());
std::istringstream iss2(col);
fcolors[i] = scanner.get_color_from_line(iss2);
}
}
else if(has_fcolors)
{
unsigned char r=0, g=0, b=0;
scanner.scan_color(r,g,b);
fcolors[i] = Color_rgb(r,g,b);
}
}
return in.good();
}
} // namespace CGAL
#endif // CGAL_IO_OFF_READER_H