mirror of https://github.com/CGAL/cgal
79 lines
2.3 KiB
C++
79 lines
2.3 KiB
C++
// Copyright (c) 2014 INRIA Sophia-Antipolis (France).
|
|
// All rights reserved.
|
|
//
|
|
// This file is part of CGAL (www.cgal.org); you can redistribute it and/or
|
|
// modify it under the terms of the GNU Lesser General Public License as
|
|
// published by the Free Software Foundation; either version 3 of the License,
|
|
// or (at your option) any later version.
|
|
//
|
|
// Licensees holding a valid commercial license may use this file in
|
|
// accordance with the commercial license agreement provided with the software.
|
|
//
|
|
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
|
|
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
|
|
//
|
|
// $URL: $
|
|
// $Id: $
|
|
//
|
|
// Author(s) : Clement Jamin
|
|
|
|
|
|
#ifndef CGAL_TRIANGULATION_OFF_OSTREAM_2_H
|
|
#define CGAL_TRIANGULATION_OFF_OSTREAM_2_H
|
|
|
|
#include <CGAL/Triangulation_2.h>
|
|
#include <sstream>
|
|
#include <iostream>
|
|
|
|
namespace CGAL {
|
|
|
|
template < class GT, class TDS >
|
|
std::ostream &
|
|
export_triangulation_2_to_off(std::ostream & os,
|
|
const Triangulation_2<GT,TDS> & tr)
|
|
{
|
|
typedef Triangulation_2<GT,TDS> Tr;
|
|
typedef typename Tr::Vertex_handle Vertex_handle;
|
|
typedef typename Tr::Vertex_iterator Vertex_iterator;
|
|
typedef typename Tr::Finite_vertices_iterator Finite_vertex_iterator;
|
|
typedef typename Tr::Finite_faces_iterator Finite_faces_iterator;
|
|
|
|
size_t n = tr.number_of_vertices();
|
|
|
|
std::stringstream output;
|
|
|
|
// write the vertices
|
|
std::map<Vertex_handle, int> index_of_vertex;
|
|
int 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() << " 0" << std::endl;
|
|
index_of_vertex[it.base()] = i;
|
|
}
|
|
CGAL_assertion( i == n );
|
|
|
|
size_t number_of_triangles = 0;
|
|
|
|
for (Finite_faces_iterator fit = tr.finite_faces_begin() ;
|
|
fit != tr.finite_faces_end() ; ++fit)
|
|
{
|
|
output << "3 "
|
|
<< index_of_vertex[fit->vertex(0)] << " "
|
|
<< index_of_vertex[fit->vertex(1)] << " "
|
|
<< index_of_vertex[fit->vertex(2)]
|
|
<< std::endl;
|
|
++number_of_triangles;
|
|
}
|
|
|
|
os << "OFF \n"
|
|
<< n << " "
|
|
<< number_of_triangles << " 0\n"
|
|
<< output.str();
|
|
|
|
return os;
|
|
}
|
|
|
|
} //namespace CGAL
|
|
|
|
#endif // CGAL_TRIANGULATION_OFF_OSTREAM_2_H
|