CGAL users discussion list

[Ram <>]

I extracted the output by creating a .vtk file and visualizing it using vtk.
The iterator lines are:

Function: template < class GT, class TDS > void
show_triangulation_edges(std::ofstream &gv, const Triangulation_3<GT,TDS>
&T)

Iterations:

Vertices: for( typename Triangulation_3<GT, TDS>::Finite_vertices_iterator
    vit = T.finite_vertices_begin(); vit != T.finite_vertices_end(); ++vit)

Tetrahedrons:

for( typename Triangulation_3<GT, TDS>::Finite_cells_iterator
          cit = T.finite_cells_begin(); cit != T.finite_cells_end(); ++cit)

The call to function is done here:


  // Triangulation access
  MyTriangulation T = c3t3.triangulation();
  std::ofstream myfile;
  myfile.open("example.vtk");
  CGAL::show_triangulation_edges(myfile, T);
  myfile.close();

Wired things happen when I visualize the output. One problem is skinny
triangles. The other problem I've seen is when I mesh a cube, some faces
have small triangles, but others have very large triangles. 

With some mesh criterion, I do see graded meshes all around. 


--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Mesh-generation-question-tp4300233p4310726.html
Sent from the cgal-discuss mailing list archive at Nabble.com.