\^^M{
  \frametitle{Student Presentation}
  Juan Llanos, {\it{The Convex Hull and the Caliper Algorithm}}
  \vskip 0.1in
  Reference: Nick Berry, "Bounding Boxes",
  http://datagenetics.com/blog/march12014/index.html
  \vskip 0.1in
  A convex hull is the smallest polygon that will contain a shape.
  \vskip 0.1in
  If we're dealing with a computer screen, then we may instead want
  the smallest {\alert{rectangle}} that can contain a shape.
}