slow booleanOverlap performance vs very fast booleanWithin

Hi,

I'm using the latest npm turf modules browserified. The code I created compares many geometries to eachother, trying to find geometries that are within others is really fast in the browser. crosschecking 3000 polygons vs itself is super fast , less than 1 second in chrome. (linux platform)

I added the same check , same code with booleanOverlap and it almost takes a minute to run over this same set (excluding testing the positive matches found with booleanWithin. The fans kick in, the CPU goes 170%.

Is there a known issue with the efficiency / performance of booleanOverlap ? Can I help analyse / assist in finding a more optimized way ? Is this by nature a hard math job to do ?

And lastly, are there any alternative approaches to detect polygons that partially overlap ?

Thanks for turf.js too, it's pretty awesome to work with. Let me know if I can help

Start by reproducing the reported comparison using booleanOverlap and booleanWithin on roughly 3,000 polygons in the browser, then inspect the booleanOverlap and booleanWithin module entry points. Compare their operation counts and profiling results; done means identifying a concrete performance cause and documenting a reproducible benchmark with improved results or a confirmed algorithmic limitation.