NateTG

Results 3 issues of NateTG

This is an inefficient method - order N^2 - but should work and large complex faces aren't going to come up often in this kind of application. [triangulate.scad.txt](https://github.com/thehans/FunctionalOpenSCAD/files/1676270/triangulate.scad.txt)

A rounded cube 'primitive' that uses cube/octahedron duality and face triangulation capability to help with subdivision.

Yet another suggestion of a method to consider for generating overhang path. ![tesslatedarcovergang](https://user-images.githubusercontent.com/4387521/224695650-1c5fc5c1-2c8b-4810-9cc4-175ac66c0b4b.png) This is one thing that I came up with when wondering whether it was possible to avoid...