Inigo Quilez has an explanation of smooth operations to join sdfs.
I am trying to get something close to the convex hull of multiple sdfs. For starters let;s consider a simple case of 3 cubes int eh following configuration:
The convex hull would be a very, very similar shape, with the exception that the region inside the l shape would be a diagonal slope.
I tried using smooth joining operations with a high weight, but I get this
The area I expected to be filled is indeed filled, but everything else bloated up. I am trying to come up with a mathematical formula to test if a point would be inside the convex hull.