Internal:Adaptive CDT3D - Smoothing: Difference between revisions
Jump to navigation
Jump to search
Created page with "= 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 q..." |
|||
| Line 7: | Line 7: | ||
4. If number of active elements >= 4 exit | 4. If number of active elements >= 4 exit | ||
4.1 else if number of active elements ==1 set dir=grad[worst] | 4.1 else if number of active elements ==1 set dir=grad[worst] | ||
4.2 else use Charalambous and Conn approach to find best dir | 4.2 else use Charalambous and Conn approach <ref> 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 </ref> to find best dir | ||
code : https://github.com/nasa/refine/blob/master/src/ref_smooth.c#L1258 | code : https://github.com/nasa/refine/blob/master/src/ref_smooth.c#L1258 | ||
Revision as of 13:39, 5 October 2018
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
- ↑ 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