Internal:Adaptive CDT3D - Smoothing

From crtc.cs.odu.edu
Jump to navigation Jump to search

NASA/refine

Pseudocode 

1. Evaluate the degree of the node and collect adajcent cells
2. For each attached cell evaluate quality and gradient of quality as well as min quality of set.
3. activate tets that (quals[i]-quals[worst]) < 1e-12
4. If number of active elements >= 4 exit
   4.1 else if number of active elements ==1 set dir=grad[worst]
   4.2 else use Charalambous and Conn approach [1] to find best dir


code : https://github.com/nasa/refine/blob/master/src/ref_smooth.c#L1258

  1. ↑ An Efficient Method to Solve the Minmax Problem Directly, C. Charalambous and A. R. Conn, https://epubs.siam.org/doi/abs/10.1137/0715011,http://www.cs.odu.edu/crtc/internal/Christos/Charalambous_An_Efficient_Method_To_Solve_The_Minmax_problem_directly.pdf
Retrieved from "https://crtc.cs.odu.edu/index.php?title=Internal:Adaptive_CDT3D_-_Smoothing&oldid=2497"