Heuristic algorithm for generating multilevel Cartesian meshes inmultidimensional regions with moving boundaries

摘要

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.