- Journal Home
- Volume 36 - 2024
- Volume 35 - 2024
- Volume 34 - 2023
- Volume 33 - 2023
- Volume 32 - 2022
- Volume 31 - 2022
- Volume 30 - 2021
- Volume 29 - 2021
- Volume 28 - 2020
- Volume 27 - 2020
- Volume 26 - 2019
- Volume 25 - 2019
- Volume 24 - 2018
- Volume 23 - 2018
- Volume 22 - 2017
- Volume 21 - 2017
- Volume 20 - 2016
- Volume 19 - 2016
- Volume 18 - 2015
- Volume 17 - 2015
- Volume 16 - 2014
- Volume 15 - 2014
- Volume 14 - 2013
- Volume 13 - 2013
- Volume 12 - 2012
- Volume 11 - 2012
- Volume 10 - 2011
- Volume 9 - 2011
- Volume 8 - 2010
- Volume 7 - 2010
- Volume 6 - 2009
- Volume 5 - 2009
- Volume 4 - 2008
- Volume 3 - 2008
- Volume 2 - 2007
- Volume 1 - 2006
Commun. Comput. Phys., 11 (2012), pp. 1372-1385.
Published online: 2012-04
Cited by
- BibTex
- RIS
- TXT
In the present work adaptation in meshless framework is proposed. The grid adaptation or mesh adaptation is quite well developed area in case of conventional grid based solvers and is popularly known as Adaptive mesh refinement (AMR). In such cases the adaptation is done by subdividing the cells or elements into finer cells or elements. In case of meshless methods there are no cells or elements but only a cloud of points. In this work we propose to achieve the meshless adaptation by locally refining the point density in the regions demanding higher resolution. This results into an adaptive enriched cloud of points. We call this method as Adaptive Cloud Refinement (ACR). The meshless solvers need connectivity information, which is a set of neighboring nodes. It is crucial part of meshless solvers. Obviously because of refining point density, the connectivity of nodes in such regions gets modified and hence has to be updated. An efficient connectivity update must exploit the fact that the node distribution would be largely unaffected except the region of adaptation. Hence connectivity updating needs to be done locally, only in these regions. In this paper we also present an extremely fast algorithm to update connectivity over adapted cloud called as ACU (Automatic Connectivity Update).
}, issn = {1991-7120}, doi = {https://doi.org/10.4208/cicp.130510.150511s}, url = {http://global-sci.org/intro/article_detail/cicp/7417.html} }In the present work adaptation in meshless framework is proposed. The grid adaptation or mesh adaptation is quite well developed area in case of conventional grid based solvers and is popularly known as Adaptive mesh refinement (AMR). In such cases the adaptation is done by subdividing the cells or elements into finer cells or elements. In case of meshless methods there are no cells or elements but only a cloud of points. In this work we propose to achieve the meshless adaptation by locally refining the point density in the regions demanding higher resolution. This results into an adaptive enriched cloud of points. We call this method as Adaptive Cloud Refinement (ACR). The meshless solvers need connectivity information, which is a set of neighboring nodes. It is crucial part of meshless solvers. Obviously because of refining point density, the connectivity of nodes in such regions gets modified and hence has to be updated. An efficient connectivity update must exploit the fact that the node distribution would be largely unaffected except the region of adaptation. Hence connectivity updating needs to be done locally, only in these regions. In this paper we also present an extremely fast algorithm to update connectivity over adapted cloud called as ACU (Automatic Connectivity Update).