LAUSR

Summary We propose a highly effective approach using a novel adaptive methodology to perform topology optimization with polygonal meshes, called polytree meshes. Polytree is a hierarchical data structure based on the principle of recursive spatial decomposition of each polygonal element with n nodes into (n + 1) arbitrary new polygonal elements; enabling more efficient utilization of unstructured meshes and arbitrary design domains in topology optimization. In order to treat hanging nodes after each optimization loop, we define the Wachspress coordinate on a reference element and then utilize an affine map to obtain shape functions and their gradients on arbitrary polygons with n vertices and m hanging nodes, called side-nodes, as the polygonal element with (n + m) vertices. The polytree meshes do not only improve the boundary description quality of the optimal result, but also reduce the computational cost of optimization process in comparison with the use of uniformly fine meshes. Several numerical examples are investigated to show the high effectiveness of the proposed method. This article is protected by copyright. All rights reserved.