songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Initial revision

This commit is contained in:
Mariette Yvinec 1998-06-29 12:37:31 +00:00
parent 7daa545240
commit ea373e70b6
2 changed files with 180 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

88
Packages/Triangulation_2/include/CGAL/IO/triangulation_Window_stream.h Normal file
View File

@ -0,0 +1,88 @@
// ============================================================================
//
// Copyright (c) 1997 The CGAL Consortium
//
// This software and related documentation is part of an INTERNAL release
// of the Computational Geometry Algorithms Library (CGAL). It is not
// intended for general use.
//
// ----------------------------------------------------------------------------
//
// release :
// release_date :
//
// file : include/CGAL/IO/triangulation_Window_stream.h
// source : web/Triangulation_2.fw
// revision : $Revision$
// revision_date : $Date$
// author(s) : Olivier Devillers
// Andreas Fabri
// Monique Teillaud
// Mariette Yvinec
//
// coordinator : Herve Bronnimann <Herve.Bronnimann@sophia.inria.fr>
//
// ============================================================================
#ifdef CGAL_TRIANGULATION_2_H
#ifndef CGAL_WINDOW_STREAM_TRIANGULATION_2_H
#define CGAL_WINDOW_STREAM_TRIANGULATION_2_H
template < class I >
CGAL_Window_stream&
operator<<(CGAL_Window_stream& os,
const CGAL_Triangulation_2<I> &T)
{
CGAL_Triangulation_2<I>::Edge_iterator it = T.edges_begin();
while(it != T.edges_end()){
os << T.segment(it);
++it;
}
return os;
}
#endif // CGAL_WINDOW_STREAM_TRIANGULATION_2_H
#endif // CGAL_TRIANGULATION_2_H
#ifdef CGAL_DELAUNAY_TRIANGULATION_2_H
#ifndef CGAL_WINDOW_STREAM_DELAUNAY_TRIANGULATION_2_H
#define CGAL_WINDOW_STREAM_DELAUNAY_TRIANGULATION_2_H
template < class I >
CGAL_Window_stream&
operator<<(CGAL_Window_stream& os,
const CGAL_Delaunay_triangulation_2<I> &T)
{
CGAL_Delaunay_triangulation_2<I>::Edge_iterator it = T.edges_begin();
while(it != T.edges_end()){
os << T.segment(it);
++it;
}
return os;
}
#endif // CGAL_WINDOW_STREAM_DELAUNAY_TRIANGULATION_2_H
#endif // CGAL_DELAUNAY_TRIANGULATION_2_H
#ifdef CGAL_CONSTRAINED_TRIANGULATION_2_H
#ifndef CGAL_WINDOW_STREAM_CONSTRAINED_TRIANGULATION_2_H
#define CGAL_WINDOW_STREAM_CONSTRAINED_TRIANGULATION_2_H
template < class I >
CGAL_Window_stream&
operator<<(CGAL_Window_stream& os,
const CGAL_Constrained_triangulation_2<I> &T)
{
CGAL_Constrained_triangulation_2<I>::Edge_iterator it = T.edges_begin();
while(it != T.edges_end()){
os << T.segment(it);
++it;
}
return os;
}
#endif // CGAL_WINDOW_STREAM_CONSTRAINED_TRIANGULATION_2_H
#endif // CGAL_CONSTRAINED_TRIANGULATION_2_H

92
Packages/Triangulation_2/include/CGAL/IO/triangulation_print_OFF.h Normal file
View File

@ -0,0 +1,92 @@
// ============================================================================
//
// Copyright (c) 1997 The CGAL Consortium
//
// This software and related documentation is part of an INTERNAL release
// of the Computational Geometry Algorithms Library (CGAL). It is not
// intended for general use.
//
// ----------------------------------------------------------------------------
//
// release :
// release_date :
//
// file : include/CGAL/IO/triangulation_print_OFF.h
// source : web/Triangulation_2.fw
// revision : $Revision$
// revision_date : $Date$
// author(s) : Lutz Kettner <kettner@inf.ethz.ch>
//
// coordinator : Herve Bronnimann <Herve.Bronnimann@sophia.inria.fr>
//
// ============================================================================
// Print a Triangulation<Traits> with 3d points in object file format (OFF).
#ifndef CGAL_TRIANGULATION_PRINT_OFF_H
#define CGAL_TRIANGULATION_PRINT_OFF_H 1
#ifndef CGAL_PROTECT_MAP_H
#include <map.h>
#define CGAL_PROTECT_MAP_H
#endif // CGAL_PROTECT_MAP_H
template < class Triang >
void
CGAL_triangulation_print_OFF( ostream& out, const Triang& triang,
bool binary = false, bool noc = false)
{
CGAL_precondition( triang.is_valid());
typedef typename Triang::Vertex Vertex;
typedef typename Triang::Vertex_iterator Vertex_iterator;
typedef typename Triang::Face_iterator Face_iterator;
// Build a map from vertex pointers to vertex indices.
map<const Vertex*,size_t, less<const Vertex*> > mapping;
size_t vn = 0;
Vertex_iterator vi = triang.vertices_begin();
for ( ; vi != triang.vertices_end(); ++vi) {
CGAL_assertion( ! triang.is_infinite( vi));
mapping[ &*vi] = vn;
vn++;
}
CGAL_assertion( vn == triang.number_of_vertices());
// Count finite and infinite faces.
size_t fn = 0;
Face_iterator fi = triang.faces_begin();
for ( ; fi != triang.faces_end(); ++fi) {
CGAL_assertion( ! triang.is_infinite( fi));
fn++;
}
size_t fin = triang.number_of_faces() - fn;
CGAL_File_writer_OFF writer( binary, noc);
writer.header( out, vn, 3 * fn + fin, fn);
vi = triang.vertices_begin();
for ( ; vi != triang.vertices_end(); ++vi) {
CGAL_assertion( ! triang.is_infinite( vi));
writer.write_vertex(CGAL_to_double(vi->point().x()),
CGAL_to_double(vi->point().y()),
CGAL_to_double(vi->point().z()));
}
writer.write_facet_header();
fi = triang.faces_begin();
while ( fn --) {
writer.write_facet_begin( 3);
CGAL_assertion( mapping.find(&*(fi->vertex(0))) != mapping.end());
CGAL_assertion( mapping.find(&*(fi->vertex(1))) != mapping.end());
CGAL_assertion( mapping.find(&*(fi->vertex(2))) != mapping.end());
writer.write_facet_vertex_index( mapping[ &*(fi->vertex(0))]);
writer.write_facet_vertex_index( mapping[ &*(fi->vertex(1))]);
writer.write_facet_vertex_index( mapping[ &*(fi->vertex(2))]);
writer.write_facet_end();
++fi;
}
CGAL_assertion( fi == triang.faces_end());
writer.footer();
}
#endif // CGAL_TRIANGULATION_PRINT_OFF_H //