I created a sort of polar distribution of hexagons using a cluster of 7, translated to division points on offset bigger hexagons. This way I achieve the effect of a polar array, as I have a slider that increases number of offset curves.
However, the only way to round off the corners is to use inside/outside brep logic, and the grid changes are not very precise as each row adds a cluster, not a single hexagon.
Is there a way to create a single row version so it would be sorted as a grid and be close to circular shape without test in brep?
Not sure why that matters. If you create the cluster as a group or a branch, you can ungroup or flatten everything at the end so you have individual hexagon cells then continue to use inside/outside brep like you planned to.
at that point if you want to filter based on circle inclusion you could just check the distance of each exagon center to the center point of the circle, and compare that distance with circle radius:
