LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Mura, G.; Hinchliffe, B.; Qin, N. (2016)
Languages: English
Types: Other
Subjects:

Classified by OpenAIRE into

ACM Ref: ComputingMethodologies_COMPUTERGRAPHICS
arxiv: Computer Science::Graphics, Mathematics::Numerical Analysis
Surface mesh sensitivity in the discrete adjoint framework is efficiently computed using the Delaunay graph method. The method results in an explicit algebraic map between the volume and surface mesh for which the solution of the linear mesh-adjoint system, generally associated with any implicit mesh movement, is not required. This method is used for the computation of the metric term sensitivity as well as a mesh movement. This requires a careful Delaunay decomposition of the computation domain. A new formulation of the Delaunay mesh movement is presented in order to improve the decomposition of the computational domain.
  • No references.
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article