The tool is free and currently needs some testing.
So any feedback is very welcome especially regarding performance and usability.
HOW IT WORKS:
It detects the intersecting primitives, then blur their point positions.
This process is repeated iteratively inside a feedback loop.
FEATURES:
- Up 3x faster Intersections Detection than vanilla Boolean Detect, thanks to parallel processing. This feature alone can save a lot of time with heavy geometries.
- Manual Mode with caching implemented: You can run a number of iterations, and follow up with a second run of iterations to improve upon the previous work.
- Automated Mode: auto-adjustments of the parameters on each iteration based on the performance in the previous iteration. The HDA aggression to the geometry can automatically increase or decrease.
- Automated Mode: manual launch button. You can set the parameters and then launch.
- Automated Mode: live-link. The process is automatically triggered at each geometry or parameter change. This is very useful for procedural and wedging workflows.
- Status Report: directly on the parameter interface, so to facilitate the workflow.
- Log for each iteration: in the geometry spreadsheet of the second output.