A quadtree data structure for the coupled finite-element/element-free Galerkin method

In the present paper, we derive an e>cient data structure for the organization of the nodes in the coupled 1nite element=element-free Galerkin method. With respect to its implementation, we compare various approaches of recursive spatial discretizations that facilitate most ?exible handling of the nodes. The goal of the paper is to re1ne the implementation issues of the data structure which is fundamental to the element-free Galerkin method and thus to speed-up this otherwise computationally rather expensive meshfree method.