Studio parts editor, decals, connectivity...

[Lasse Deleuran]

check this tool to generate mesh https://www.cs.cmu.edu/~quake/triangle.html

Thanks. Another person also referred me to this implementation of Delauney-triangulation. Is it because you would prefer the triangulation to adhere to the Delauney constraint? Please note that this algorithm does not take quads and T-junctions into account.

My current algorithm creates quads and runs a step to prevent T-junctions. These can be added as steps on top of a Delauney triangulation (just like they currently are steps on top of a greedy heuristic), but they will invalidate the Delauney constraint, resulting in a heuristic. The question then becomes. Does creating a heuristic on top of a Delauney triangulation yield a preferred result?