![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
Abstract
In this paper, we address the construction of a Hamiltonian path for conforming tetrahedral meshes on distributed memory machines. The path is constrained to pass from one element to the next one through a vertex. For a conforming tetrahedral mesh whose dual graph is connected, if it can be split into many submeshes and the dual graphs of these submeshes are connected, then we can construct partial Hamiltonian paths for all submeshes independently and a Hamiltonian path for the mesh can be obtained by connecting these partial Hamiltonian paths.
Acknowledgements
The support of Department of Chemical and Petroleum Engineering, University of Calgary, Reservoir Simulation Group and Academy of Mathematics and Systems Science, Chinese Academy of Sciences, is gratefully acknowledged. The research is also partly supported by NSERC/AIEE/Foundation CMG and AITF Chairs, as well as by National 973 Project of China (2011CB309703), National 863 Project of China (2012AA01A3094), China NSF (11171334, 11021101), and National Center for Mathematics and Interdisciplinary Sciences of Chinese Academy of Sciences.