Add alternative version of findRandomPointAroundCircle that uses polygon circles and clipping tests

[grahamboree]

Adapted from #487

Recast4j has a query method that works by approximating a circle with a dodecagon and using the convex-convex intersection algorithm by O'Rourke (recast4j/recast4j@44e4e33). The version uses polygon clipping to mask out the query radius and is roughly 30% slower. This is often an acceptable tradeoff as it's much more likely to find valid positions when searching in certain environments.