mirror of https://github.com/vitalif/openscad
310 lines
8.6 KiB
C++
310 lines
8.6 KiB
C++
#include "printutils.h"
|
|
#include "dxftess.h"
|
|
#include "dxfdata.h"
|
|
#include "polyset.h"
|
|
#include "grid.h"
|
|
|
|
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
|
|
#include <CGAL/Constrained_Delaunay_triangulation_2.h>
|
|
#include <CGAL/Delaunay_mesher_2.h>
|
|
#include <CGAL/Delaunay_mesher_no_edge_refinement_2.h>
|
|
#include <CGAL/Delaunay_mesh_face_base_2.h>
|
|
#include <CGAL/Delaunay_mesh_criteria_2.h>
|
|
|
|
typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
|
|
typedef CGAL::Triangulation_vertex_base_2<K> Vb;
|
|
typedef CGAL::Delaunay_mesh_face_base_2<K> Fb;
|
|
typedef CGAL::Triangulation_data_structure_2<Vb, Fb> Tds;
|
|
typedef CGAL::Constrained_Delaunay_triangulation_2<K, Tds> CDT;
|
|
//typedef CGAL::Delaunay_mesh_criteria_2<CDT> Criteria;
|
|
|
|
typedef CDT::Vertex_handle Vertex_handle;
|
|
typedef CDT::Point CDTPoint;
|
|
|
|
#include <CGAL/Mesh_2/Face_badness.h>
|
|
|
|
template <class T> class DummyCriteria {
|
|
public:
|
|
typedef double Quality;
|
|
class Is_bad {
|
|
public:
|
|
CGAL::Mesh_2::Face_badness operator()(const Quality) const {
|
|
return CGAL::Mesh_2::NOT_BAD;
|
|
}
|
|
CGAL::Mesh_2::Face_badness operator()(const typename T::Face_handle&, Quality&q) const {
|
|
q = 1;
|
|
return CGAL::Mesh_2::NOT_BAD;
|
|
}
|
|
};
|
|
Is_bad is_bad_object() const { return Is_bad(); }
|
|
};
|
|
|
|
struct triangle {
|
|
struct { double x, y; } p[3];
|
|
bool is_inner, is_marked;
|
|
};
|
|
|
|
struct point_info_t
|
|
{
|
|
double x, y;
|
|
int pathidx, pointidx;
|
|
int max_pointidx_in_path;
|
|
QList<int> triangles;
|
|
|
|
struct point_info_t *neigh_next;
|
|
struct point_info_t *neigh_prev;
|
|
|
|
point_info_t(double x, double y, int a, int b, int c) :
|
|
x(x), y(y), pathidx(a), pointidx(b), max_pointidx_in_path(c) { }
|
|
point_info_t() : x(0), y(0), pathidx(-1), pointidx(-1), max_pointidx_in_path(-1) { }
|
|
};
|
|
|
|
typedef QPair<point_info_t*,point_info_t*> edge_t;
|
|
|
|
void mark_inner_outer(QList<struct triangle> &tri, Grid2d<point_info_t> &point_info,
|
|
QHash<edge_t,int> &edge_to_triangle, QHash<edge_t,int> &edge_to_path, int idx, bool inner)
|
|
{
|
|
if (tri[idx].is_marked)
|
|
return;
|
|
|
|
tri[idx].is_inner = inner;
|
|
tri[idx].is_marked = true;
|
|
|
|
point_info_t *p[3] = {
|
|
&point_info.data(tri[idx].p[0].x, tri[idx].p[0].y),
|
|
&point_info.data(tri[idx].p[1].x, tri[idx].p[1].y),
|
|
&point_info.data(tri[idx].p[2].x, tri[idx].p[2].y)
|
|
};
|
|
|
|
edge_t edges[3] = {
|
|
edge_t(p[1], p[0]),
|
|
edge_t(p[2], p[1]),
|
|
edge_t(p[0], p[2])
|
|
};
|
|
|
|
for (int i = 0; i < 3; i++) {
|
|
if (edge_to_triangle.contains(edges[i])) {
|
|
bool next_inner = edge_to_path.contains(edges[i]) ? !inner : inner;
|
|
mark_inner_outer(tri, point_info, edge_to_triangle, edge_to_path,
|
|
edge_to_triangle[edges[i]], next_inner);
|
|
}
|
|
}
|
|
}
|
|
|
|
void dxf_tesselate(PolySet *ps, DxfData *dxf, double rot, bool up, bool /* do_triangle_splitting */, double h)
|
|
{
|
|
CDT cdt;
|
|
|
|
QList<struct triangle> tri;
|
|
Grid2d<point_info_t> point_info(GRID_FINE);
|
|
QHash<edge_t,int> edge_to_triangle;
|
|
QHash<edge_t,int> edge_to_path;
|
|
|
|
// read path data and copy all relevant infos
|
|
for (int i = 0; i < dxf->paths.count(); i++)
|
|
{
|
|
if (!dxf->paths[i].is_closed)
|
|
continue;
|
|
|
|
Vertex_handle first, prev;
|
|
struct point_info_t *first_pi = NULL, *prev_pi = NULL;
|
|
for (int j = 1; j < dxf->paths[i].points.count(); j++)
|
|
{
|
|
double x = dxf->paths[i].points[j]->x;
|
|
double y = dxf->paths[i].points[j]->y;
|
|
|
|
if (point_info.has(x, y)) {
|
|
// FIXME: How can the same path set contain the same point twice?
|
|
// ..maybe it would be better to assert here. But this would
|
|
// break compatibility with the glu tesselator that handled such
|
|
// cases just fine.
|
|
continue;
|
|
}
|
|
|
|
struct point_info_t *pi = &point_info.align(x, y);
|
|
*pi = point_info_t(x, y, i, j, dxf->paths[i].points.count()-1);
|
|
|
|
Vertex_handle vh = cdt.insert(CDTPoint(x, y));
|
|
if (first_pi == NULL) {
|
|
first_pi = pi;
|
|
first = vh;
|
|
} else {
|
|
prev_pi->neigh_next = pi;
|
|
pi->neigh_prev = prev_pi;
|
|
edge_to_path[edge_t(prev_pi, pi)] = 1;
|
|
edge_to_path[edge_t(pi, prev_pi)] = 1;
|
|
cdt.insert_constraint(prev, vh);
|
|
}
|
|
prev_pi = pi;
|
|
prev = vh;
|
|
}
|
|
|
|
if (first_pi != NULL && first_pi != prev_pi)
|
|
{
|
|
prev_pi->neigh_next = first_pi;
|
|
first_pi->neigh_prev = prev_pi;
|
|
|
|
edge_to_path[edge_t(first_pi, prev_pi)] = 1;
|
|
edge_to_path[edge_t(prev_pi, first_pi)] = 1;
|
|
|
|
cdt.insert_constraint(prev, first);
|
|
}
|
|
}
|
|
|
|
// run delaunay triangulation
|
|
std::list<CDTPoint> list_of_seeds;
|
|
CGAL::refine_Delaunay_mesh_2_without_edge_refinement(cdt,
|
|
list_of_seeds.begin(), list_of_seeds.end(), DummyCriteria<CDT>());
|
|
|
|
// copy triangulation results
|
|
CDT::Finite_faces_iterator iter = cdt.finite_faces_begin();
|
|
for(; iter != cdt.finite_faces_end(); ++iter)
|
|
{
|
|
if (!iter->is_in_domain())
|
|
continue;
|
|
|
|
int idx = tri.size();
|
|
tri.append(triangle());
|
|
|
|
point_info_t *pi[3];
|
|
for (int i=0; i<3; i++) {
|
|
double px = iter->vertex(i)->point()[0];
|
|
double py = iter->vertex(i)->point()[1];
|
|
pi[i] = &point_info.align(px, py);
|
|
pi[i]->triangles.append(idx);
|
|
tri[idx].p[i].x = px;
|
|
tri[idx].p[i].y = py;
|
|
}
|
|
|
|
edge_to_triangle[edge_t(pi[0], pi[1])] = idx;
|
|
edge_to_triangle[edge_t(pi[1], pi[2])] = idx;
|
|
edge_to_triangle[edge_t(pi[2], pi[0])] = idx;
|
|
}
|
|
|
|
// mark trianlges as inner/outer
|
|
while (1)
|
|
{
|
|
double far_left_x = 0;
|
|
struct point_info_t *far_left_p = NULL;
|
|
|
|
for (int i = 0; i < tri.size(); i++)
|
|
{
|
|
if (tri[i].is_marked)
|
|
continue;
|
|
|
|
for (int j = 0; j < 3; j++) {
|
|
double x = tri[i].p[j].x;
|
|
double y = tri[i].p[j].y;
|
|
if (far_left_p == NULL || x < far_left_x) {
|
|
far_left_x = x;
|
|
far_left_p = &point_info.data(x, y);
|
|
}
|
|
}
|
|
}
|
|
|
|
if (far_left_p == NULL)
|
|
break;
|
|
|
|
// find one inner triangle and run recursive marking
|
|
for (int i = 0; i < far_left_p->triangles.size(); i++)
|
|
{
|
|
int idx = far_left_p->triangles[i];
|
|
|
|
if (tri[idx].is_marked)
|
|
continue;
|
|
|
|
point_info_t *p0 = &point_info.data(tri[idx].p[0].x, tri[idx].p[0].y);
|
|
point_info_t *p1 = &point_info.data(tri[idx].p[1].x, tri[idx].p[1].y);
|
|
point_info_t *p2 = &point_info.data(tri[idx].p[2].x, tri[idx].p[2].y);
|
|
point_info_t *mp = NULL, *np1 = NULL, *np2 = NULL, *tp = NULL;
|
|
|
|
if (p0 == far_left_p)
|
|
mp = p0, np1 = p1, np2 = p2;
|
|
else if (p1 == far_left_p)
|
|
mp = p1, np1 = p0, np2 = p2;
|
|
else if (p2 == far_left_p)
|
|
mp = p2, np1 = p0, np2 = p1;
|
|
else
|
|
continue;
|
|
|
|
if (mp->neigh_next == np2 || mp->neigh_prev == np1) {
|
|
point_info_t *t = np1;
|
|
np1 = np2;
|
|
np2 = t;
|
|
}
|
|
|
|
if (mp->neigh_next == np1 && mp->neigh_prev == np2) {
|
|
mark_inner_outer(tri, point_info, edge_to_triangle, edge_to_path, idx, true);
|
|
goto found_and_marked_inner;
|
|
}
|
|
|
|
if (mp->neigh_next == np1)
|
|
tp = np2;
|
|
|
|
if (mp->neigh_prev == np2)
|
|
tp = np1;
|
|
|
|
if (tp != NULL) {
|
|
double z0 = (mp->neigh_next->x - mp->x) * (mp->neigh_prev->y - mp->y) -
|
|
(mp->neigh_prev->x - mp->x) * (mp->neigh_next->y - mp->y);
|
|
double z1 = (mp->neigh_next->x - mp->x) * (tp->y - mp->y) -
|
|
(tp->x - mp->x) * (mp->neigh_next->y - mp->y);
|
|
double z2 = (tp->x - mp->x) * (mp->neigh_prev->y - mp->y) -
|
|
(mp->neigh_prev->x - mp->x) * (tp->y - mp->y);
|
|
if ((z0 < 0 && z1 < 0 && z2 < 0) || (z0 > 0 && z1 > 0 && z2 > 0)) {
|
|
mark_inner_outer(tri, point_info, edge_to_triangle, edge_to_path, idx, true);
|
|
goto found_and_marked_inner;
|
|
}
|
|
}
|
|
}
|
|
|
|
// far left point is in the middle of a vertical segment
|
|
// -> it is ok to use any unmarked triangle connected to this point
|
|
for (int i = 0; i < far_left_p->triangles.size(); i++)
|
|
{
|
|
int idx = far_left_p->triangles[i];
|
|
|
|
if (tri[idx].is_marked)
|
|
continue;
|
|
|
|
mark_inner_outer(tri, point_info, edge_to_triangle, edge_to_path, idx, true);
|
|
break;
|
|
}
|
|
|
|
found_and_marked_inner:;
|
|
}
|
|
|
|
// add all inner triangles to target polyset
|
|
for(int i = 0; i < tri.size(); i++)
|
|
{
|
|
if (!tri[i].is_inner)
|
|
continue;
|
|
|
|
ps->append_poly();
|
|
int path[3], point[3];
|
|
for (int j=0;j<3;j++) {
|
|
int idx = up ? j : (2-j);
|
|
double px = tri[i].p[idx].x;
|
|
double py = tri[i].p[idx].y;
|
|
ps->append_vertex(px * cos(rot*M_PI/180) + py * sin(rot*M_PI/180),
|
|
px * -sin(rot*M_PI/180) + py * cos(rot*M_PI/180), h);
|
|
path[j] = point_info.data(px, py).pathidx;
|
|
point[j] = point_info.data(px, py).pointidx;
|
|
}
|
|
|
|
if (path[0] == path[1] && point[0] == 1 && point[1] == 2)
|
|
dxf->paths[path[0]].is_inner = up;
|
|
if (path[0] == path[1] && point[0] == 2 && point[1] == 1)
|
|
dxf->paths[path[0]].is_inner = !up;
|
|
if (path[1] == path[2] && point[1] == 1 && point[2] == 2)
|
|
dxf->paths[path[1]].is_inner = up;
|
|
if (path[1] == path[2] && point[1] == 2 && point[2] == 1)
|
|
dxf->paths[path[1]].is_inner = !up;
|
|
|
|
if (path[2] == path[0] && point[2] == 1 && point[0] == 2)
|
|
dxf->paths[path[2]].is_inner = up;
|
|
if (path[2] == path[0] && point[2] == 2 && point[0] == 1)
|
|
dxf->paths[path[2]].is_inner = !up;
|
|
}
|
|
}
|