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
[email protected]
https://lists.sourceforge.net/lists/listinfo/libmesh-users
