CGAL users discussion list

[Ram <>]

Here is the code I'm using

int main() 
{ 
  // Create domain 
  Polyhedron polyhedron; 
  make_cube_3(polyhedron); 
  Mesh_domain domain(polyhedron); 
  
  // Get sharp features 
  domain.detect_features(); 

  // Mesh criteria 
  Mesh_criteria criteria(edge_size = 25.0, 
                         facet_angle = 15, facet_size = 15.0, 
                         facet_distance = 0.05, 
                         cell_radius_edge_ratio = 3, cell_size = 50.0); 
  
  // Mesh generation 
  C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria); 
  std::cout << "Basic Mesh generated...\n";
  
  // Insert points here
  typedef C3t3::Triangulation Tr;
  typedef Tr::Point Point_3;
  std::vector<Point_3> plist;
  std::vector<double> slist;
  parse_input(plist, slist);
  for(unsigned int i = 0; i < plist.size(); ++i){
    Point_3 p = plist[i];
    c3t3.triangulation().insert(Point_3(plist[i][0], plist[i][1],
plist[i][2]));
  }
  
  std::cout << "Total number of points inserted: " << 
                    c3t3.triangulation().number_of_vertices() << std::endl;

  // Set tetrahedron size (keep cell_radius_edge), ignore facets
  Mesh_criteria new_criteria(facet_angle=20.0, cell_radius_edge=3,
cell_size=125.0);

  // Mesh refinement
  CGAL::refine_mesh_3(c3t3, domain, new_criteria);  

  // Output 
  std::ofstream medit_file("out.mesh"); 
  c3t3.output_to_medit(medit_file); 
} 

======================= I would like to not post my complete code in here,
but if you want, I can email you the complete code. Hope this helps in
nailing down the problem already.

Thanks,
--Ram

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