convex hull of polyhedral sets
ConvexHull(ps1, ps2, ..., psn)
ConvexHull(ps1, ps2, ..., psn, method = m)
ps1, ps2, ..., psn
sequence of n polyhedral sets
(optional) one of hrepresentation (default) or vrepresentation
This command computes the convex hull of a sequence of polyhedral sets, returning the result as a new PolyhedralSet.
The method = hrepresentation option computes the convex hull using the H-Representation of the polyhedral sets, forming their convex hull by accumulating the sets of relations.
The method = vrepresentation option constructs a convex hull using the V-Representation of the polyhedral sets, computing their vertices and rays and combining the results to form a new set.
There is also a ConvexHulls command in the ComputationalGeometry package. The Convex Hulls Example Worksheet discusses both commands and the usefulness of each.
A dodecahedron can be formed as the convex hull of a tetrahedron and a cube.
The tetrahedron and cube are then subsets of this convex hull.
The convex hull of a triangle with a point gives a tetrahedron.
The PolyhedralSets[ConvexHull] command was introduced in Maple 2015.
For more information on Maple 2015 changes, see Updates in Maple 2015.
Download Help Document
What kind of issue would you like to report? (Optional)