For 10 points, name these constructions of a certain shape containing all of a given set of points.
A divide and conquer approach to calculating these starts by storing the extremes and then recurses on the four sub-planes defined by the lines connecting those extremes. An efficient output-sensitive algorithm to calculate these was dubbed the "ultimate planar" one and uses the "marriage-before-conquest" approach. A simple algorithm to calculate these iteratively chooses the point with the smallest angle from horizontal. Algorithms for constructing these include Kirkpatrick-Seidel algorithm and the Jarvis Match, also known as (*) "gift wrapping." These constructs are useful for pattern recognition and collision detection, and they are usually visualized by imagining a rubber band stretching around the input points. For 10 points, name these constructions of a certain shape containing all of a given set of points.
A divide and conquer approach to calculating these starts by storing the extremes and then recurses on the four sub-planes defined by the lines connecting those extremes.
convex hull [or convex envelope; prompt on “hull” or “envelope”]