mirror of https://github.com/vitalif/openscad
106 lines
3.9 KiB
C++
106 lines
3.9 KiB
C++
/*
|
|
* OpenSCAD (www.openscad.org)
|
|
* Copyright (C) 2009-2011 Clifford Wolf <clifford@clifford.at> and
|
|
* Marius Kintel <marius@kintel.net>
|
|
*
|
|
* This program is free software; you can redistribute it and/or modify
|
|
* it under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation; either version 2 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* As a special exception, you have permission to link this program
|
|
* with the CGAL library and distribute executables, as long as you
|
|
* follow the requirements of the GNU GPL in regard to all of the
|
|
* software in the executable aside from CGAL.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program; if not, write to the Free Software
|
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
*
|
|
*/
|
|
|
|
#include "dxfdata.h"
|
|
#include "grid.h"
|
|
#include "CGAL_Nef_polyhedron.h"
|
|
#include "cgal.h"
|
|
|
|
#ifdef ENABLE_CGAL
|
|
|
|
DxfData *CGAL_Nef_polyhedron::convertToDxfData() const
|
|
{
|
|
assert(this->dim == 2);
|
|
DxfData *dxfdata = new DxfData();
|
|
Grid2d<int> grid(GRID_COARSE);
|
|
|
|
typedef CGAL_Nef_polyhedron2::Explorer Explorer;
|
|
typedef Explorer::Face_const_iterator fci_t;
|
|
typedef Explorer::Halfedge_around_face_const_circulator heafcc_t;
|
|
Explorer E = this->p2->explorer();
|
|
|
|
for (fci_t fit = E.faces_begin(), facesend = E.faces_end(); fit != facesend; ++fit)
|
|
{
|
|
heafcc_t fcirc(E.halfedge(fit)), fend(fcirc);
|
|
int first_point = -1, last_point = -1;
|
|
CGAL_For_all(fcirc, fend) {
|
|
if (E.is_standard(E.target(fcirc))) {
|
|
Explorer::Point ep = E.point(E.target(fcirc));
|
|
double x = to_double(ep.x()), y = to_double(ep.y());
|
|
int this_point = -1;
|
|
if (grid.has(x, y)) {
|
|
this_point = grid.align(x, y);
|
|
} else {
|
|
this_point = grid.align(x, y) = dxfdata->points.size();
|
|
dxfdata->points.push_back(Vector2d(x, y));
|
|
}
|
|
if (first_point < 0) {
|
|
dxfdata->paths.push_back(DxfData::Path());
|
|
first_point = this_point;
|
|
}
|
|
if (this_point != last_point) {
|
|
dxfdata->paths.back().indices.push_back(this_point);
|
|
last_point = this_point;
|
|
}
|
|
}
|
|
}
|
|
if (first_point >= 0) {
|
|
dxfdata->paths.back().is_closed = 1;
|
|
dxfdata->paths.back().indices.push_back(first_point);
|
|
}
|
|
}
|
|
|
|
dxfdata->fixup_path_direction();
|
|
return dxfdata;
|
|
}
|
|
|
|
// moved here to reduce compile size/time of compiling CGAL_Nef_polyhedron.cc
|
|
std::string CGAL_Nef_polyhedron::dump_p2() const
|
|
{
|
|
std::stringstream out;
|
|
CGAL_Nef_polyhedron2::Explorer explorer = this->p2->explorer();
|
|
CGAL_Nef_polyhedron2::Explorer::Vertex_const_iterator i;
|
|
out << "CGAL_Nef_polyhedron::p2 Vertices";
|
|
for (i = explorer.vertices_begin(); i != explorer.vertices_end(); ++i) {
|
|
if ( explorer.is_standard( i ) ) {
|
|
CGAL_Nef_polyhedron2::Explorer::Point point = explorer.point( i );
|
|
out << "\n Point x y: "
|
|
<< CGAL::to_double(point.x()) << " "
|
|
<< CGAL::to_double(point.y());
|
|
} else {
|
|
CGAL_Nef_polyhedron2::Explorer::Ray ray = explorer.ray( i );
|
|
CGAL_Nef_polyhedron2::Explorer::Point point = ray.point( 0 );
|
|
out << "\n Ray x y dx dy: "
|
|
<< CGAL::to_double(point.x()) << " " << CGAL::to_double(point.y()) << " "
|
|
<< CGAL::to_double(ray.direction().dx()) << " " << CGAL::to_double(ray.direction().dy());
|
|
}
|
|
}
|
|
out << "\nCGAL_Nef_polyhedron::p2 Vertices end";
|
|
return out.str();
|
|
}
|
|
|
|
#endif // ENABLE_CGAL
|