%0 Journal Article %1 Ji2010CellBasedAdaptiveMeshRefinement %A Ji, Hua %A Lien, Fue-Sang %A Yee, Eugene %D 2010 %J Journal of Computational Physics %K adaptive-mesh-refinement computational-physics %N 23 %P 8981 - 8993 %R http://dx.doi.org/10.1016/j.jcp.2010.08.023 %T A new adaptive mesh refinement data structure with an application to detonation %U http://www.sciencedirect.com/science/article/pii/S0021999110004705 %V 229 %X A new Cell-based Structured Adaptive Mesh Refinement (CSAMR) data structure is developed. In our \CSAMR\ data structure, Cartesian-like indices are used to identify each cell. With these stored indices, the information on the parent, children and neighbors of a given cell can be accessed simply and efficiently. Owing to the usage of these indices, the computer memory required for storage of the proposed \AMR\ data structure is only 5 8 word per cell, in contrast to the conventional oct-tree P. MacNeice, K.M. Olson, C. Mobary, R. deFainchtein, C. Packer, PARAMESH: a parallel adaptive mesh refinement community toolkit, Comput. Phys. Commun. 330 (2000) 126 and the fully threaded tree (FTT) A.M. Khokhlov, Fully threaded tree algorithms for adaptive mesh fluid dynamics simulations, J. Comput. Phys. 143 (1998) 519 data structures which require, respectively, 19 and 2 3 8 words per cell for storage of the connectivity information. Because the connectivity information (e.g., parent, children and neighbors) of a cell in our proposed \AMR\ data structure can be accessed using only the cell indices, a tree structure which was required in previous approaches for the organization of the \AMR\ data is no longer needed for this new data structure. Instead, a much simpler hash table structure is used to maintain the \AMR\ data, with the entry keys in the hash table obtained directly from the explicitly stored cell indices. The proposed \AMR\ data structure simplifies the implementation and parallelization of an \AMR\ code. Two three-dimensional test cases are used to illustrate and evaluate the computational performance of the new \CSAMR\ data structure.

@article{Ji2010CellBasedAdaptiveMeshRefinement, abstract = {A new Cell-based Structured Adaptive Mesh Refinement (CSAMR) data structure is developed. In our \{CSAMR\} data structure, Cartesian-like indices are used to identify each cell. With these stored indices, the information on the parent, children and neighbors of a given cell can be accessed simply and efficiently. Owing to the usage of these indices, the computer memory required for storage of the proposed \{AMR\} data structure is only 5 8 word per cell, in contrast to the conventional oct-tree [P. MacNeice, K.M. Olson, C. Mobary, R. deFainchtein, C. Packer, PARAMESH: a parallel adaptive mesh refinement community toolkit, Comput. Phys. Commun. 330 (2000) 126] and the fully threaded tree (FTT) [A.M. Khokhlov, Fully threaded tree algorithms for adaptive mesh fluid dynamics simulations, J. Comput. Phys. 143 (1998) 519] data structures which require, respectively, 19 and 2 3 8 words per cell for storage of the connectivity information. Because the connectivity information (e.g., parent, children and neighbors) of a cell in our proposed \{AMR\} data structure can be accessed using only the cell indices, a tree structure which was required in previous approaches for the organization of the \{AMR\} data is no longer needed for this new data structure. Instead, a much simpler hash table structure is used to maintain the \{AMR\} data, with the entry keys in the hash table obtained directly from the explicitly stored cell indices. The proposed \{AMR\} data structure simplifies the implementation and parallelization of an \{AMR\} code. Two three-dimensional test cases are used to illustrate and evaluate the computational performance of the new \{CSAMR\} data structure. }, added-at = {2016-05-20T23:33:02.000+0200}, author = {Ji, Hua and Lien, Fue-Sang and Yee, Eugene}, biburl = {https://www.bibsonomy.org/bibtex/235e9424d42c8d7d1eb915d8529a3728d/salotz}, description = {A new adaptive mesh refinement data structure with an application to detonation}, doi = {http://dx.doi.org/10.1016/j.jcp.2010.08.023}, interhash = {963e664a48aa7ca78686fd901e757f3a}, intrahash = {35e9424d42c8d7d1eb915d8529a3728d}, issn = {0021-9991}, journal = {Journal of Computational Physics }, keywords = {adaptive-mesh-refinement computational-physics}, number = 23, pages = {8981 - 8993}, timestamp = {2016-05-20T23:33:02.000+0200}, title = {A new adaptive mesh refinement data structure with an application to detonation }, url = {http://www.sciencedirect.com/science/article/pii/S0021999110004705}, volume = 229, year = 2010 }