Hello forum,
hopefully finding an answer here, I'm looking for a simple algorithm for a rounded-cube with params like width/heigth/depth. edge-radius and number of segments. Ive ported the "superellipse" algo but for a seamless result the numer of verticies IMHO is mucht too high (about 8000) and scaling in one direction has negative influences for the edge radius when leaving the quad shape.
As far I've searched in the internet, this topic seems not so easy, or am I wrong?
Anyway, here is my playground : http://www.babylonjs-playground.com/#14VFYX
Thank you in advance