A bounded region is recursively divided into regions until a condition is met. Each split line may consists of small points that are iterated in small steps (as shown above). New positions at each step re-computes the closest point to its containing region until it intersects with the region, resulting in an interpolated split sensitive to the original shape.

Also tried something similar using c# on grasshopper before, trying to re-code this in maya with python in a way that is easier to translate into c++, so most of the small parts can be tested in python to get quick results before compiling.

Some notes on the test implemenation and translation, switching between python and c++:
list/vector : list [start:end] | std::vector iterator or std::list
return: auto unpack multiple type | use reference like what maya does in its api and return a status