diff options
| author | Don Bright <hugh.m.bright@gmail.com> | 2013-12-15 04:15:57 (GMT) |
|---|---|---|
| committer | Don Bright <hugh.m.bright@gmail.com> | 2013-12-15 04:15:57 (GMT) |
| commit | 60a4561da5b0592f20910e8a9ea4fcdbb1b1a2f7 (patch) | |
| tree | 5cbfa7ded50ba911516aa876dc128ec5967b0555 /src/dxftess-cgal.cc | |
| parent | f12237a9c4b39349da673456e7e309562ed0f75a (diff) | |
fix bug in polyhedron() primitive keyword 'faces' vs 'triangles'
Diffstat (limited to 'src/dxftess-cgal.cc')
| -rw-r--r-- | src/dxftess-cgal.cc | 6 |
1 files changed, 1 insertions, 5 deletions
diff --git a/src/dxftess-cgal.cc b/src/dxftess-cgal.cc index ebdcf58..e5c62c4 100644 --- a/src/dxftess-cgal.cc +++ b/src/dxftess-cgal.cc @@ -466,8 +466,6 @@ using CGAL's Constrained Delaunay algorithm. This code assumes the input polyset has simple polygon faces with no holes, no self intersections, and no duplicate points. */ void tessellate_3d_faces( const PolySet &inps, PolySet &outps ) { - PRINTB("tess 3d %i",inps.polygons.size()); - PRINTB("%s < input ps",inps.dump()); for (size_t i = 0; i < inps.polygons.size(); i++) { const PolySet::Polygon pgon = inps.polygons[i]; if (pgon.size()<3) continue; @@ -482,9 +480,7 @@ void tessellate_3d_faces( const PolySet &inps, PolySet &outps ) { outps.append_vertex(t[2].x(),t[2].y(),t[2].z()); } } - PRINTB("tess 3d done %i",outps.polygons.size()); - PRINTB("%s < output ps",outps.dump()); } -// End of the Tessellation of PolySet polygons +// End of PolySet face tessellation code |