Abstract
Universal algorithm for fully automated generation of multilevel Cartesian mesh in arbitrary planar regions with moving boundaries is developed and discussed in details. It uses multilevel tree technology and heuristic enabling flexible mesh adaptation to changes of boundaries. Efficient mixed coding for mesh storing is presented. Suggested algorithm generates meshes with properties most desirable for computing various field distribution problems. Main parts of elaborated algorithm are generalized for multidimensional meshes.
Sign-in/Register to access full text options 
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.
