A fully autonomous procedure to generate the Meshless point distribution in regular and irregular geometries may be devised with the use of Quadtree (Octree in 3D). A Quadtree is a tree data structure whose construction is based on the recursive decomposition of the Cartesian plane. Specifically, a region-based Quadtree is defined by the recursive partitioning of the Cartesian plane into four equally-sized quadrants which lie parallel to the coordinate axis. This recursion can be repeated until a model resolution criterion is achieved.