So, I can construct a random polyhedron and find its 3 silhouettes onto the 3 standard planes.
For example,
polyhedron = PolyhedronCoordinates[RandomPolyhedron[{"ConvexHull", 10}]];
(* Projection Functions *)
projections = polyhedron[[All, #]] & /@ {{1, 2}, {1, 3}, {2, 3}};
(* Find Convex Hulls and Create Graphics *)
graphics = Graphics[Polygon[MeshCoordinates[#][[MeshCells[#, 2][[1, 1]]]]]] & /@ (ConvexHullMesh /@ projections);
(* Labeled Graphics *)
titles = {"XY Projection", "XZ Projection", "YZ Projection"};
labeledGraphics = MapThread[Labeled[#1, #2, Bottom] &, {graphics, titles}];
(* Display *)
GraphicsGrid[{labeledGraphics}]
An example polyhedron and its projections are shown below:
which gives the three orthographic projections:
The question is, given the three standard orthographic projections, how do I find the original convex polyhedron knowing that the polyhedron is convex?
UPDATE:
So, cvgmt's answer is correct, it was not unique with how the question was originally posed, and there is a lot of value in that answer. But I feel that it would be good to extend the question to include solutions that would reconstruct the original convex polyhedron using minimal information. I am moving the goalpost, that is why I approved cvgmt's answer, and am setting a bounty on this. I think there are multiple ways to do this. For example, looking at a different set of silhouettes. Or looking at a small continuous set of silhouettes instead of discrete.
One way I am thinking is something like this, but not quite sure how to code it exactly, :
Shadows in a Bounding Box
Imagine the Z-axis goes in and out of the board, positive Z out of the board, the X-axis is left to right, and the Y-axis is up and down. So, since we have the projections onto the bounding box, let's say we use the XY+ projection, the XY- projection, the YZ+ projection, and the YZ- projection. The XY+ projection and the XY- projection are the exact same, except that XY- has the same Z-coordinate as the smallest Z from the original polyhedron and XY+ has the largest Z coordinate as the largest Z from the original polyhedron. The YZ+ projection and the YZ- projection are the exact same, except that YZ- has the same X-coordinate as the smallest X from the original polyhedron and YZ+ has the largest X coordinate as the largest X from the original polyhedron. The respected projections, XY+ to YZ+ to XY- to YZ- form a 'ring' around the the original bounding box. Note how we don't need the XZ projections. The 'cylinder' is then from XZ- to XZ+, lines are drawn to connect the line segments with the same Y-value. Then find the convex hull. I am not sure if that would work or not.
Cylinder is a poor word choice, but I cannot think of anything better.