Abstract
In this paper, we introduce two new functionals within the context of the variational grid generation problem: an area functional and a smoothness functional. Both of them are based on an improved adaptive algorithm which focuses on the most folded grid cells. It is shown that when they are minimized in order to generate smooth and convex grids on irregular planar regions the optimization process converges notably faster than it does with other functionals previously reported.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
