Yes it was the version of Triangle in libmesh, I've seen that theres something similar for 3D I think, Tetgen right? At the moment I'm happy with 2D, since my research is not focused on meshes and space adaptivity, nevertheless I can't have hanging nodes. The code is quite large, theres a lot of stuff around the mesh adaptivity, I will try to set up something simple and clear soon and share it with you :) Giacomo
On 04/06/2017 05:36 PM, Roy Stogner wrote: > > On Thu, 6 Apr 2017, John Peterson wrote: > >> The algorithm is: >> - call save_mesh >> - call add_remove_node >> - call new_Delaunay_mesh >> - call equation_systems.reinit(), which will call >> project_vector >> and project_on_new_delaunay_mesh. >> >> The most expensive part are the project_on_new_delaunay_mesh and >> new_Delaunay_mesh methods, save_mesh is negligible. If you're >> interested >> I could set up a running example and send it to you. >> >> >> This sounds pretty interesting! I assume you used the version of >> Triangle that is distributed with libmesh? Do you have any plans >> for doing something similar for 3D? >> >> If you are willing to share your code that would be great, it might >> inspire someone else to make it into a more generalized libmesh >> capability... > > Yeah, even if it was just on a separate branch that got mothballed for > a while, it would be great to have as a reference. For isotropic > adaptivity I'm not interested in this algorithm, but this sort of > thing is the only way I've seen people do *completely* anisotropic > adaptivity, and I'd love to be able to play with that one day. > --- > Roy ------------------------------------------------------------------------------ Check out the vibrant tech community on one of the world's most engaging tech sites, Slashdot.org! http://sdm.link/slashdot _______________________________________________ Libmesh-users mailing list Libmesh-users@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/libmesh-users
