Interpreting a convex hull as an intersection of halfspaces and then dropping the planes which do not meaningfully constrain the volume of the hull wouldn't be too hard to implement.
The most difficult part would be enumerating the vertices of the resulting plane set; this tends to be pretty slow or pretty complicated.
Not a priority for release; external tools can be used at content time to do the same thing.
Interpreting a convex hull as an intersection of halfspaces and then dropping the planes which do not meaningfully constrain the volume of the hull wouldn't be too hard to implement.
The most difficult part would be enumerating the vertices of the resulting plane set; this tends to be pretty slow or pretty complicated.
Not a priority for release; external tools can be used at content time to do the same thing.