Sturm says: that’s very easy or impossible depending … well … you know what.
BTW: Given a Graph (general case: Curves) , the V, E Lists and the VV, EV connectivity … mastermind some sort or recursion that can cut the mustard (i.e. working SOLELY on connectivity Trees [real-time since they are int Types]).
BTW: Sharpen your skills as follows: given a Graph and using only the VV Tree can you find the islands?
May the Force (the Dark option) be with you.
Sturm says: why design a neighborhood that looks like a leaf from above? Is any rational reason for that around? (None, that is). What about to cover the whole Planet with just one Mega City and be a happy bunny? (The Final Goal, that is). What about free lobotomy for all? (Sooner or later).
Sturm’s solution/salvation: Get real, time flies, do the following:
Using a Crv that looks like a leaf (LOL) do some Vor stuff inside the boundary (I hate Voronoi things like my sins, I confess):
Using the Vor polylines do the V, VV (List, Tree) and use the C# that you have already in order to create the “roads” (in fact tubes not connected each other > call Elon Musk and having zillions on hand ask for His Assistance [Hyper Loop etc etc])
Then just press the red button and get suitable for our Times towers (without windows: who needs them?). Plus get some “indicative” green areas for historical purposes (but why bother with these?):