The convex hull of a point set is the smallest convex shape containing them all — the rubber band snapped around the outermost points. Gift wrapping (Jarvis march) builds it by orientation alone: start at the leftmost point and repeatedly pick the next point that is most clockwise, so every other point lies to one side. Interior points are simply dropped — they belong to no hull edge. For the square’s four corners plus an interior point, the hull is the four corners; the inside point (2,2), being within a triangle of the others, is excluded.
The demo shows the hull excludes an interior point — (2,2) is inside triangle (0,0),(4,0),(0,4), while corner (4,4) is not: live demo
“You must consider every point for the outline.” — only the extremes; interior points belong to no hull edge and are dropped. cited
A band around the outermost points, the inside let go — the shape read off by orientation. resource
On the canonical compiler, (2,2) is inside triangle (0,0),(4,0),(0,4) so it is not a hull vertex; corner (4,4) is not inside, so it is kept: