Internal:Adaptive CDT3D - Smoothing: Difference between revisions

From crtc.cs.odu.edu
Jump to navigation Jump to search
← Older editNewer edit →
Ctsolakis (talk | contribs)
BrainMapping, CNF, HPC, I2MConversion, NDAM, Segmentation, UltraSound3D, Bureaucrats, external, internal, Administrators
2,152 edits
Ctsolakis (talk | contribs)
BrainMapping, CNF, HPC, I2MConversion, NDAM, Segmentation, UltraSound3D, Bureaucrats, external, internal, Administrators
2,152 edits
Line 8: Line 8:
     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 <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
     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
* smoothing : [https://onlinelibrary.wiley.com/doi/abs/10.1002/%28SICI%291097-0207%2819971115%2940%3A21%3C3979%3A%3AAID-NME251%3E3.0.CO%3B2-9 Tetrahedral Mesh Improvement Using Swapping and Smoothing, Lori A. Freitag and Carl Ollivier-Gooch ] [http://www.cs.odu.edu/crtc/internal/Christos/Freitag_et_al-1997-International_Journal_for_Numerical_Methods_in_Engineering.pdf PDF]

Revision as of 13:44, 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

  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=2502"