Just in case there’s a chance that this feature finds its way into Obsidian’s core functionality, I’d like to share my findings with you. But implemented as a plugin, I’m expecting too many performance issues.
| Algorithm | Description |
|---|---|
| Welzel’s Algorithm | Finds the minimum enclosing circle around a bunch of nodes if the folders should look like pretty circles. |
| Quickhull | Finds the outer nodes of a cloud of nodes that comprise a convex hull. Perhaps it could speed up overall performance if it is used before Welzel’s Algorithm to reduce its input parameters. |
| Centripetal Catmul-Rom Splines | This smoothes the shape of the polygon hull. |
