Def the computing time went orders of magnitude down. Evolutionary solvers are blind after all.
Here’s a nice example of the power of evolutionary solvers.
I can’t see any way these sorts of results could be achieved by simple gradient descent.
Well … in fact a slightly different approach is required here: given a boundary List AND an indicative “start” partitioning per boundary (via either “spines” or lines or both) … get the polylines (split BrepFace with Curves then get the outer Loops) and then … blah, blah.
Plus there’s the building regulations (per country) that MAY dictate some additional goal(s) with regard the acceptable parcel shape/topology and the derivant building clearances per parcel etc etc. This makes the whole puzzle more challenging,
Good points. For making the polylines, one further issue is that some plot boundaries will need to be split not just at their corners, but also at points on their straight sides when there is a t-junction with multiple plots adjacent, otherwise triangular voids of no man’s land could appear in between. I think maybe the script Giulio posted here could be part of how to do this.
Also agree that further constraints might be necessary to constrain the plots to reasonable shapes, such as no very sharp angles. If the initial division is not fairly close to the final one, it could also become necessary to allow for some sorts of topological changes, which would make this all much more complicated.
Well … cases like these are like annual checkups > better avoid doing them because you’ll never know what may pop-up out of the blue, he he.
May save your life as well.